default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJosé M. Valério de Carvalho
Person information
- affiliation: University of Minho, Portugal
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j41]John Martinovic
, Nico Strasdat, José M. Valério de Carvalho, Fabio Furini:
A combinatorial flow-based formulation for temporal bin packing problems. Eur. J. Oper. Res. 307(2): 554-574 (2023)- 2022
- [j40]Vinícius Loti de Lima, Cláudio Alves, François Clautiaux, Manuel Iori, José M. Valério de Carvalho:
Arc flow formulations based on dynamic programming: Theoretical foundations and applications. Eur. J. Oper. Res. 296(1): 3-21 (2022) - [j39]Bruna Ramos, Cláudio Alves, José M. Valério de Carvalho:
An arc flow formulation to the multitrip production, inventory, distribution, and routing problem with time windows. Int. Trans. Oper. Res. 29(1): 526-553 (2022) - [j38]John Martinovic, Nico Strasdat, José M. Valério de Carvalho, Fabio Furini:
Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups. Optim. Lett. 16(8): 2333-2358 (2022) - 2020
- [j37]Telmo Pinto, Cláudio Alves, José M. Valério de Carvalho:
Variable neighborhood search algorithms for the vehicle routing problem with two-dimensional loading constraints and mixed linehauls and backhauls. Int. Trans. Oper. Res. 27(1): 549-572 (2020) - [i1]Vinícius Loti de Lima, Cláudio Alves, François Clautiaux, Manuel Iori, José M. Valério de Carvalho:
Arc Flow Formulations Based on Dynamic Programming: Theoretical Foundations and Applications. CoRR abs/2010.00558 (2020)
2010 – 2019
- 2019
- [j36]John J. Quiroga-Orozco, José M. Valério de Carvalho, Robinson S. V. Hoto:
A strong integer linear optimization model to the compartmentalized knapsack problem. Int. Trans. Oper. Res. 26(5): 1633-1654 (2019) - 2018
- [j35]Telmo Pinto, Cláudio Alves, José M. Valério de Carvalho:
Column generation based primal heuristics for routing and loading problems. Electron. Notes Discret. Math. 64: 135-144 (2018) - [j34]Bruna Ramos, Cláudio Alves, José M. Valério de Carvalho:
Column Generation Based Approaches for Combined Routing and Scheduling. Electron. Notes Discret. Math. 64: 155-164 (2018) - [j33]John Martinovic, Guntram Scheithauer, José M. Valério de Carvalho:
A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems. Eur. J. Oper. Res. 266(2): 458-471 (2018) - 2017
- [j32]Telmo Pinto, Cláudio Alves, José M. Valério de Carvalho:
Variable neighborhood search algorithms for pickup and delivery problems with loading constraints. Electron. Notes Discret. Math. 58: 111-118 (2017) - 2016
- [j31]Jürgen Rietz, Cláudio Alves, Nuno Braga, José M. Valério de Carvalho:
An exact approach based on a new pseudo-polynomial network flow model for integrated planning and scheduling. Comput. Oper. Res. 76: 183-194 (2016) - [j30]Antonio Miguel Gomes, José Fernando Gonçalves, Ramón Alvarez-Valdés, José M. Valério de Carvalho:
Preface to the Special Issue on Cutting and Packing. Int. Trans. Oper. Res. 23(1-2): 3-4 (2016) - [c10]Telmo Pinto, Cláudio Alves, José M. Valério de Carvalho:
A Branch-and-Price Algorithm for the Vehicle Routing Problem with 2-Dimensional Loading Constraints. ICCL 2016: 321-336 - 2015
- [j29]Rita Macedo, Cláudio Alves, Saïd Hanafi, Bassem Jarboui, Nenad Mladenovic, Bruna Ramos, José M. Valério de Carvalho:
Skewed general variable neighborhood search for the location routing scheduling problem. Comput. Oper. Res. 61: 143-152 (2015) - [j28]Jürgen Rietz, Cláudio Alves, José M. Valério de Carvalho, François Clautiaux:
Constructing general dual-feasible functions. Oper. Res. Lett. 43(4): 427-431 (2015) - [c9]Jürgen Rietz, Cláudio Alves, José M. Valério de Carvalho:
Fast Heuristics for Integrated Planning and Scheduling. ICCSA (2) 2015: 413-428 - [c8]Telmo Pinto, Cláudio Alves, José M. Valério de Carvalho:
Variable Neighborhood Search for the Elementary Shortest Path Problem with Loading Constraints. ICCSA (2) 2015: 474-489 - [c7]Nuno Braga, Cláudio Alves, Rita Macedo, José M. Valério de Carvalho:
A Model-Based Heuristic for the Combined Cutting Stock and Scheduling Problem. ICCSA (2) 2015: 490-505 - 2014
- [j27]Cláudio Alves, José M. Valério de Carvalho, François Clautiaux, Jürgen Rietz:
Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem. Eur. J. Oper. Res. 233(1): 43-63 (2014) - [j26]Elsa Silva, Filipe Pereira Alvelos, José M. Valério de Carvalho:
Integrating two-dimensional cutting stock and lot-sizing problems. J. Oper. Res. Soc. 65(1): 108-123 (2014) - [c6]Jürgen Rietz, Cláudio Alves, José Manuel Valério de Carvalho, François Clautiaux:
On the Properties of General Dual-Feasible Functions. ICCSA (2) 2014: 180-194 - [c5]Filipe Pereira Alvelos, Elsa Silva, José Manuel Valério de Carvalho:
A Hybrid Heuristic Based on Column Generation for Two- and Three- Stage Bin Packing Problems. ICCSA (2) 2014: 211-226 - 2012
- [j25]Cláudio Alves, Pedro Brás, José M. Valério de Carvalho, Telmo Pinto:
New constructive algorithms for leather nesting in the automotive industry. Comput. Oper. Res. 39(7): 1487-1505 (2012) - [j24]Jürgen Rietz, Cláudio Alves, José M. Valério de Carvalho:
Worst-case analysis of maximal dual feasible functions. Optim. Lett. 6(8): 1687-1705 (2012) - [j23]Jürgen Rietz, Cláudio Alves, José M. Valério de Carvalho:
On the extremality of maximal dual feasible functions. Oper. Res. Lett. 40(1): 25-30 (2012) - [c4]Jürgen Rietz, Cláudio Alves, José M. Valério de Carvalho, François Clautiaux:
Computing Valid Inequalities for General Integer Programs using an Extension of Maximal Dual Feasible Functions to Negative Arguments. ICORES 2012: 39-47 - [c3]Cláudio Alves, Raïd Mansi, Telmo Pinto, José M. Valério de Carvalho:
A Column Generation Approach for the Bi-objective Max-min Knapsack Problem. ICORES 2012: 165-170 - [c2]Rita Macedo, Saïd Hanafi, François Clautiaux, Cláudio Alves, José M. Valério de Carvalho:
Generalized Disaggregation Algorithm for the Vehicle Routing Problem with Time Windows and Multiple Routes. ICORES 2012: 305-312 - 2011
- [j22]T. M. Chan, Filipe Pereira Alvelos, Elsa Silva, José M. Valério de Carvalho:
Heuristics with Stochastic Neighborhood Structures for Two-Dimensional Bin Packing and Cutting Stock Problems. Asia Pac. J. Oper. Res. 28(2): 255-278 (2011) - [j21]Rita Macedo, Cláudio Alves, José M. Valério de Carvalho, François Clautiaux, Saïd Hanafi:
Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model. Eur. J. Oper. Res. 214(3): 536-545 (2011) - [j20]Carina Maria Oliveira Pimentel, Filipe Pereira Alvelos, António J. S. T. Duarte, José M. Valério de Carvalho:
Exact and heuristic approaches for lot splitting and scheduling on identical parallel machines. Int. J. Manuf. Technol. Manag. 22(1): 39-57 (2011) - [j19]François Clautiaux, Cláudio Alves, José M. Valério de Carvalho, Jürgen Rietz:
New Stabilization Procedures for the Cutting Stock Problem. INFORMS J. Comput. 23(4): 530-545 (2011) - 2010
- [j18]François Clautiaux, Cláudio Alves, José M. Valério de Carvalho:
A survey of dual-feasible and superadditive functions. Ann. Oper. Res. 179(1): 317-342 (2010) - [j17]Rita Macedo, Cláudio Alves, José M. Valério de Carvalho:
Arc-flow model for the two-dimensional guillotine cutting stock problem. Comput. Oper. Res. 37(6): 991-1001 (2010) - [j16]Isabel Cristina Lopes, José M. Valério de Carvalho:
An integer programming model for the Minimum Interval Graph Completion Problem. Electron. Notes Discret. Math. 36: 583-590 (2010) - [j15]Elsa Silva, Filipe Pereira Alvelos, José M. Valério de Carvalho:
An integer programming model for two- and three-stage two-dimensional cutting stock problems. Eur. J. Oper. Res. 205(3): 699-708 (2010) - [j14]Carina Maria Oliveira Pimentel, Filipe Pereira Alvelos, José Manuel Valério de Carvalho:
Comparing Dantzig-Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem. Optim. Methods Softw. 25(2): 299-319 (2010) - [j13]Jürgen Rietz, Cláudio Alves, José M. Valério de Carvalho:
Theoretical investigations on maximal dual feasible functions. Oper. Res. Lett. 38(3): 174-178 (2010)
2000 – 2009
- 2009
- [j12]Cláudio Alves, Rita Macedo, José M. Valério de Carvalho:
New lower bounds based on column generation and constraint programming for the pattern minimization problem. Comput. Oper. Res. 36(11): 2944-2954 (2009) - [c1]Rita Macedo, Cláudio Alves, José M. Valério de Carvalho:
Exact Algorithms for Vehicle Routing Problems with Different Service Constraints. CTW 2009: 215-218 - 2008
- [j11]Cláudio Alves, José M. Valério de Carvalho:
A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem. Comput. Oper. Res. 35(4): 1315-1328 (2008) - [j10]Cláudio Alves, José M. Valério de Carvalho:
New integer programming formulations and an exact algorithm for the ordered cutting stock problem. J. Oper. Res. Soc. 59(11): 1520-1531 (2008) - [j9]Cláudio Alves, José M. Valério de Carvalho:
A branch-and-price-and-cut algorithm for the pattern minimization problem. RAIRO Oper. Res. 42(4): 435-453 (2008) - 2007
- [j8]Manuel J. Pereira Lopes, José M. Valério de Carvalho:
A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times. Eur. J. Oper. Res. 176(3): 1508-1527 (2007) - [j7]Cláudio Alves, José M. Valério de Carvalho:
Accelerating column generation for variable sized bin-packing problems. Eur. J. Oper. Res. 183(3): 1333-1352 (2007) - [j6]Filipe Pereira Alvelos, José M. Valério de Carvalho:
An extended model and a column generation algorithm for the planar multicommodity flow problem. Networks 50(1): 3-16 (2007) - 2006
- [j5]Hatem Ben Amor, Jacques Desrosiers, José M. Valério de Carvalho:
Dual-Optimal Inequalities for Stabilized Column Generation. Oper. Res. 54(3): 454-463 (2006) - 2005
- [j4]José M. Valério de Carvalho:
Using Extra Dual Cuts to Accelerate Column Generation. INFORMS J. Comput. 17(2): 175-182 (2005) - 2002
- [j3]José M. Valério de Carvalho:
A Note on Branch-and-Price Algorithms for the One-Dimensional Cutting Stock Problems. Comput. Optim. Appl. 21(3): 339-340 (2002) - [j2]José M. Valério de Carvalho:
LP models for bin packing and cutting stock problems. Eur. J. Oper. Res. 141(2): 253-273 (2002)
1990 – 1999
- 1999
- [j1]José M. Valério de Carvalho:
Exact solution of bin-packing problems using column generation and branch-and-bound. Ann. Oper. Res. 86: 629-659 (1999)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:13 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
