José M. Valério de Carvalho

51 papers C 4Journal 43Unranked 4
YearRankTypeTitle / Venue / Authors
2026 J jnl
Corrigendum to "A new effective heuristic for the Prisoner Transportation Problem".
Eur. J. Oper. Res.
Luciano Ferreira, Marcos Vinícius Milan Milan, José M. Valério de Carvalho, Elsa Silva, Filipe Pereira Alvelos
2025 J jnl
A new effective heuristic for the Prisoner Transportation Problem.
Eur. J. Oper. Res.
Luciano Ferreira, Marcos Vinicius Milan Maciel, José M. Valério de Carvalho, Elsa Silva, Filipe Pereira Alvelos
2023 J jnl
A combinatorial flow-based formulation for temporal bin packing problems.
Eur. J. Oper. Res.
John Martinovic, Nico Strasdat, José M. Valério de Carvalho, Fabio Furini
2022 J jnl
An arc flow formulation to the multitrip production, inventory, distribution, and routing problem with time windows.
Int. Trans. Oper. Res.
Bruna Ramos, Cláudio Alves, José M. Valério de Carvalho
2022 J jnl
Arc flow formulations based on dynamic programming: Theoretical foundations and applications.
Eur. J. Oper. Res.
Vinícius Loti de Lima, Cláudio Alves, François Clautiaux, Manuel Iori, José M. Valério de Carvalho
2022 J jnl
Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups.
Optim. Lett.
John Martinovic, Nico Strasdat, José M. Valério de Carvalho, Fabio Furini
2020 J jnl
Arc Flow Formulations Based on Dynamic Programming: Theoretical Foundations and Applications.
CoRR
Vinícius Loti de Lima, Cláudio Alves, François Clautiaux, Manuel Iori, José M. Valério de Carvalho
2020 J jnl
Variable neighborhood search algorithms for the vehicle routing problem with two-dimensional loading constraints and mixed linehauls and backhauls.
Int. Trans. Oper. Res.
Telmo Pinto, Cláudio Alves, José M. Valério de Carvalho
2019 J jnl
A strong integer linear optimization model to the compartmentalized knapsack problem.
Int. Trans. Oper. Res.
John J. Quiroga-Orozco, José M. Valério de Carvalho, Robinson S. V. Hoto
2018 J jnl
A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems.
Eur. J. Oper. Res.
John Martinovic, Guntram Scheithauer, José M. Valério de Carvalho
2018 J jnl
Column Generation Based Approaches for Combined Routing and Scheduling.
Electron. Notes Discret. Math.
Bruna Ramos, Cláudio Alves, José M. Valério de Carvalho
2018 J jnl
Column generation based primal heuristics for routing and loading problems.
Electron. Notes Discret. Math.
Telmo Pinto, Cláudio Alves, José M. Valério de Carvalho
2017 J jnl
Variable neighborhood search algorithms for pickup and delivery problems with loading constraints.
Electron. Notes Discret. Math.
Telmo Pinto, Cláudio Alves, José M. Valério de Carvalho
2016 — conf
A Branch-and-Price Algorithm for the Vehicle Routing Problem with 2-Dimensional Loading Constraints.
ICCL
Telmo Pinto, Cláudio Alves, José M. Valério de Carvalho
2016 J jnl
An exact approach based on a new pseudo-polynomial network flow model for integrated planning and scheduling.
Comput. Oper. Res.
Jürgen Rietz, Cláudio Alves, Nuno Braga, José M. Valério de Carvalho
2016 J jnl
Preface to the Special Issue on Cutting and Packing.
Int. Trans. Oper. Res.
Antonio Miguel Gomes, José Fernando Gonçalves, Ramón Alvarez-Valdés, José M. Valério de Carvalho
2015 — conf
A Model-Based Heuristic for the Combined Cutting Stock and Scheduling Problem.
ICCSA (2)
Nuno Braga, Cláudio Alves, Rita Macedo, José M. Valério de Carvalho
2015 J jnl
Constructing general dual-feasible functions.
Oper. Res. Lett.
Jürgen Rietz, Cláudio Alves, José M. Valério de Carvalho, François Clautiaux
2015 — conf
Fast Heuristics for Integrated Planning and Scheduling.
ICCSA (2)
Jürgen Rietz, Cláudio Alves, José M. Valério de Carvalho
2015 J jnl
Skewed general variable neighborhood search for the location routing scheduling problem.
Comput. Oper. Res.
Rita Macedo, Cláudio Alves, Saïd Hanafi, Bassem Jarboui, Nenad Mladenovic, Bruna Ramos, José M. Valério de Carvalho
2015 — conf
Variable Neighborhood Search for the Elementary Shortest Path Problem with Loading Constraints.
ICCSA (2)
Telmo Pinto, Cláudio Alves, José M. Valério de Carvalho
2014 J jnl
Integrating two-dimensional cutting stock and lot-sizing problems.
J. Oper. Res. Soc.
Elsa Silva, Filipe Pereira Alvelos, José M. Valério de Carvalho
2014 J jnl
Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem.
Eur. J. Oper. Res.
Cláudio Alves, José M. Valério de Carvalho, François Clautiaux, Jürgen Rietz
2012 C conf
A Column Generation Approach for the Bi-objective Max-min Knapsack Problem.
ICORES
Cláudio Alves, Raïd Mansi, Telmo Pinto, José M. Valério de Carvalho
2012 C conf
Computing Valid Inequalities for General Integer Programs using an Extension of Maximal Dual Feasible Functions to Negative Arguments.
ICORES
Jürgen Rietz, Cláudio Alves, José M. Valério de Carvalho, François Clautiaux
2012 C conf
Generalized Disaggregation Algorithm for the Vehicle Routing Problem with Time Windows and Multiple Routes.
ICORES
Rita Macedo, Saïd Hanafi, François Clautiaux, Cláudio Alves, José M. Valério de Carvalho
2012 J jnl
New constructive algorithms for leather nesting in the automotive industry.
Comput. Oper. Res.
Cláudio Alves, Pedro Brás, José M. Valério de Carvalho, Telmo Pinto
2012 J jnl
On the extremality of maximal dual feasible functions.
Oper. Res. Lett.
Jürgen Rietz, Cláudio Alves, José M. Valério de Carvalho
2012 J jnl
Worst-case analysis of maximal dual feasible functions.
Optim. Lett.
Jürgen Rietz, Cláudio Alves, José M. Valério de Carvalho
2011 J jnl
Exact and heuristic approaches for lot splitting and scheduling on identical parallel machines.
Int. J. Manuf. Technol. Manag.
Carina Maria Oliveira Pimentel, Filipe Pereira Alvelos, António J. S. T. Duarte, José M. Valério de Carvalho
2011 J jnl
Heuristics with Stochastic Neighborhood Structures for Two-Dimensional Bin Packing and Cutting Stock Problems.
Asia Pac. J. Oper. Res.
T. M. Chan, Filipe Pereira Alvelos, Elsa Silva, José M. Valério de Carvalho
2011 J jnl
New Stabilization Procedures for the Cutting Stock Problem.
INFORMS J. Comput.
François Clautiaux, Cláudio Alves, José M. Valério de Carvalho, Jürgen Rietz
2011 J jnl
Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model.
Eur. J. Oper. Res.
Rita Macedo, Cláudio Alves, José M. Valério de Carvalho, François Clautiaux, Saïd Hanafi
2010 J jnl
A survey of dual-feasible and superadditive functions.
Ann. Oper. Res.
François Clautiaux, Cláudio Alves, José M. Valério de Carvalho
2010 J jnl
An integer programming model for the Minimum Interval Graph Completion Problem.
Electron. Notes Discret. Math.
Isabel Cristina Lopes, José M. Valério de Carvalho
2010 J jnl
An integer programming model for two- and three-stage two-dimensional cutting stock problems.
Eur. J. Oper. Res.
Elsa Silva, Filipe Pereira Alvelos, José M. Valério de Carvalho
2010 J jnl
Arc-flow model for the two-dimensional guillotine cutting stock problem.
Comput. Oper. Res.
Rita Macedo, Cláudio Alves, José M. Valério de Carvalho
2010 J jnl
Theoretical investigations on maximal dual feasible functions.
Oper. Res. Lett.
Jürgen Rietz, Cláudio Alves, José M. Valério de Carvalho
2009 C conf
Exact Algorithms for Vehicle Routing Problems with Different Service Constraints.
CTW
Rita Macedo, Cláudio Alves, José M. Valério de Carvalho
2009 J jnl
New lower bounds based on column generation and constraint programming for the pattern minimization problem.
Comput. Oper. Res.
Cláudio Alves, Rita Macedo, José M. Valério de Carvalho
2008 J jnl
A branch-and-price-and-cut algorithm for the pattern minimization problem.
RAIRO Oper. Res.
Cláudio Alves, José M. Valério de Carvalho
2008 J jnl
A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem.
Comput. Oper. Res.
Cláudio Alves, José M. Valério de Carvalho
2008 J jnl
New integer programming formulations and an exact algorithm for the ordered cutting stock problem.
J. Oper. Res. Soc.
Cláudio Alves, José M. Valério de Carvalho
2007 J jnl
A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times.
Eur. J. Oper. Res.
Manuel J. Pereira Lopes, José M. Valério de Carvalho
2007 J jnl
Accelerating column generation for variable sized bin-packing problems.
Eur. J. Oper. Res.
Cláudio Alves, José M. Valério de Carvalho
2007 J jnl
An extended model and a column generation algorithm for the planar multicommodity flow problem.
Networks
Filipe Pereira Alvelos, José M. Valério de Carvalho
2006 J jnl
Dual-Optimal Inequalities for Stabilized Column Generation.
Oper. Res.
Hatem Ben Amor, Jacques Desrosiers, José M. Valério de Carvalho
2005 J jnl
Using Extra Dual Cuts to Accelerate Column Generation.
INFORMS J. Comput.
José M. Valério de Carvalho
2002 J jnl
A Note on Branch-and-Price Algorithms for the One-Dimensional Cutting Stock Problems.
Comput. Optim. Appl.
José M. Valério de Carvalho
2002 J jnl
LP models for bin packing and cutting stock problems.
Eur. J. Oper. Res.
José M. Valério de Carvalho
1999 J jnl
Exact solution of bin-packing problems using column generation and branch-and-bound.
Ann. Oper. Res.
José M. Valério de Carvalho