José M. Valério de Carvalho

Publication Activity (10 Years)

Years Active: 1999-2023
Publications (10 Years): 19

Top Topics

Routing Problem

Search Algorithm

Top Venues

Int. Trans. Oper. Res.

Eur. J. Oper. Res.

Electron. Notes Discret. Math.

Publications

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) (2023)
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) (2022)
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) (2022)
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) (2022)
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 (2020)
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) (2020)
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) (2019)
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) (2018)
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 (2018)
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 (2018)
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 (2017)
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 (2016)
A. 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) (2016)
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)
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) (2015)
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)
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 (2015)
Jürgen Rietz, Cláudio Alves, José M. Valério de Carvalho
Fast Heuristics for Integrated Planning and Scheduling. ICCSA (2) (2015)
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)
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) (2014)
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) (2014)
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)
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)
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)
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) (2012)
Jürgen Rietz, Cláudio Alves, José M. Valério de Carvalho
Worst-case analysis of maximal dual feasible functions. Optim. Lett. 6 (8) (2012)
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) (2012)
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) (2011)
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) (2011)
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) (2011)
Carina Maria Oliveira Pimentel, Filipe Pereira Alvelos, Antonio 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) (2011)
Jürgen Rietz, Cláudio Alves, José M. Valério de Carvalho
Theoretical investigations on maximal dual feasible functions. Oper. Res. Lett. 38 (3) (2010)
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) (2010)
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 (2010)
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) (2010)
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) (2010)
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) (2009)
Rita Macedo, Cláudio Alves, José M. Valério de Carvalho
Exact Algorithms for Vehicle Routing Problems with Different Service Constraints. CTW (2009)
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) (2008)
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) (2008)
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) (2008)
Cláudio Alves, José M. Valério de Carvalho
Accelerating column generation for variable sized bin-packing problems. Eur. J. Oper. Res. 183 (3) (2007)
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) (2007)
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) (2007)
Hatem Ben Amor, Jacques Desrosiers, José M. Valério de Carvalho
Dual-Optimal Inequalities for Stabilized Column Generation. Oper. Res. 54 (3) (2006)
José M. Valério de Carvalho
Using Extra Dual Cuts to Accelerate Column Generation. INFORMS J. Comput. 17 (2) (2005)
José M. Valério de Carvalho
LP models for bin packing and cutting stock problems. Eur. J. Oper. Res. 141 (2) (2002)
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) (2002)
José M. Valério de Carvalho
Exact solution of bin-packing problems using column generation and branch-and-bound. Ann. Oper. Res. 86 (1999)