José Manuel Vasconcelos Valério de Carvalho


AuthID: R-000-8PV

Confirmed Publications: 43



31
TITLE: A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem  Full Text
AUTHORS: Claudio Alves ; Valerio M V De Carvalho ;
PUBLISHED: 2008, SOURCE: COMPUTERS & OPERATIONS RESEARCH, VOLUME: 35, ISSUE: 4
INDEXED IN: Scopus WOS CrossRef
IN MY: ORCID | ResearcherID
32
TITLE: New integer programming formulations and an exact algorithm for the ordered cutting stock problem
AUTHORS: Alves, C ; Valerio de Carvalho, JMV ;
PUBLISHED: 2008, SOURCE: JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, VOLUME: 59, ISSUE: 11
INDEXED IN: Scopus WOS CrossRef
IN MY: ORCID | ResearcherID
33
TITLE: A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times  Full Text
AUTHORS: Manuel J P Pereira Lopes ; Valerio de Carvalho, JMV ;
PUBLISHED: 2007, SOURCE: EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, VOLUME: 176, ISSUE: 3
INDEXED IN: Scopus WOS CrossRef
IN MY: ORCID | ResearcherID
34
TITLE: Accelerating column generation for variable sized bin-packing problems  Full Text
AUTHORS: Claudio Alves ; Valerio M V de Carvalho ;
PUBLISHED: 2007, SOURCE: EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, VOLUME: 183, ISSUE: 3
INDEXED IN: Scopus WOS CrossRef
IN MY: ORCID | ResearcherID
35
TITLE: An extended model and a column generation algorithm for the planar multicommodity flow problem  Full Text
AUTHORS: Filipe Alvelos ; Valerio de Carvalho, JMV ;
PUBLISHED: 2007, SOURCE: International Network Optimization Conference in NETWORKS, VOLUME: 50, ISSUE: 1
INDEXED IN: Scopus WOS CrossRef
IN MY: ORCID | ResearcherID
36
TITLE: Dual-optimal inequalities for stabilized column generation  Full Text
AUTHORS: Ben Amor, H; Desrosiers, J; de Carvalho, JMV ;
PUBLISHED: 2006, SOURCE: OPERATIONS RESEARCH, VOLUME: 54, ISSUE: 3
INDEXED IN: Scopus WOS CrossRef
IN MY: ORCID | ResearcherID
37
TITLE: Using extra dual cuts to accelerate column generation  Full Text
AUTHORS: de Carvalho, JMV ;
PUBLISHED: 2005, SOURCE: INFORMS JOURNAL ON COMPUTING, VOLUME: 17, ISSUE: 2
INDEXED IN: Scopus WOS CrossRef
IN MY: ORCID | ResearcherID
38
TITLE: A note on branch-and-price algorithms for the one-dimensional cutting stock problems  Full Text
AUTHORS: de Carvalho, JMV ;
PUBLISHED: 2002, SOURCE: COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, VOLUME: 21, ISSUE: 3
INDEXED IN: Scopus WOS CrossRef: 11
IN MY: ORCID | ResearcherID
39
TITLE: LP models for bin packing and cutting stock problems  Full Text
AUTHORS: de Carvalho, JMV ;
PUBLISHED: 2002, SOURCE: EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, VOLUME: 141, ISSUE: 2
INDEXED IN: Scopus WOS CrossRef
IN MY: ORCID | ResearcherID
40
TITLE: Exact solution of bin-packing problems using column generation and branch-and-bound  Full Text
AUTHORS: de Carvalho, JMV ;
PUBLISHED: 1999, SOURCE: Combinatorial Optimisation 96 Conference (CO96) in ANNALS OF OPERATIONS RESEARCH, VOLUME: 86
INDEXED IN: Scopus WOS
IN MY: ORCID | ResearcherID
Page 4 of 5. Total results: 43.

A place for researchers and their institutions

Useful Links

Get Help

© 2024 CRACS & Inesc TEC - All Rights Reserved Privacy Policy | Terms of Service