Exact solution of bin-packing problems using column generation and branch-and-bound. - José M. Valério de Carvalho (Ann. Oper. Res., 1999)

A Note on Branch-and-Price Algorithms for the One-Dimensional Cutting Stock Problems. - José M. Valério de Carvalho (Comput. Optim. Appl., 2002)

LP models for bin packing and cutting stock problems. - José M. Valério de Carvalho (Eur. J. Oper. Res., 2002)

Using Extra Dual Cuts to Accelerate Column Generation. - José M. Valério de Carvalho (INFORMS J. Comput., 2005)

Dual-Optimal Inequalities for Stabilized Column Generation. - Hatem Ben Amor; Jacques Desrosiers; José M. Valério de Carvalho (Oper. Res., 2006)

Accelerating column generation for variable sized bin-packing problems. - Cláudio Alves; José M. Valério de Carvalho (Eur. J. Oper. Res., 2007)

A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times. - Manuel J. Pereira Lopes; José M. Valério de Carvalho (Eur. J. Oper. Res., 2007)

An extended model and a column generation algorithm for the planar multicommodity flow problem. - Filipe Pereira Alvelos; José M. Valério de Carvalho (Networks, 2007)

A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem. - Cláudio Alves; José M. Valério de Carvalho (Comput. Oper. Res., 2008)

New integer programming formulations and an exact algorithm for the ordered cutting stock problem. - Cláudio Alves; José M. Valério de Carvalho (J. Oper. Res. Soc., 2008)

A branch-and-price-and-cut algorithm for the pattern minimization problem. - Cláudio Alves; José M. Valério de Carvalho (RAIRO Oper. Res., 2008)

Exact Algorithms for Vehicle Routing Problems with Different Service Constraints. - Rita Macedo; Cláudio Alves; José M. Valério de Carvalho (CTW, 2009)

New lower bounds based on column generation and constraint programming for the pattern minimization problem. - Cláudio Alves; Rita Macedo; José M. Valério de Carvalho (Comput. Oper. Res., 2009)

A survey of dual-feasible and superadditive functions. - François Clautiaux; Cláudio Alves; José M. Valério de Carvalho (Ann. Oper. Res., 2010)

Arc-flow model for the two-dimensional guillotine cutting stock problem. - Rita Macedo; Cláudio Alves; José M. Valério de Carvalho (Comput. Oper. Res., 2010)

An integer programming model for the Minimum Interval Graph Completion Problem. - Isabel Cristina Lopes; José M. Valério de Carvalho (Electron. Notes Discret. Math., 2010)

An integer programming model for two- and three-stage two-dimensional cutting stock problems. - Elsa Silva; Filipe Pereira Alvelos; José M. Valério de Carvalho (Eur. J. Oper. Res., 2010)

Comparing Dantzig-Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem. - Carina Maria Oliveira Pimentel; Filipe Pereira Alvelos; José Manuel Valério de Carvalho (Optim. Methods Softw., 2010)

Theoretical investigations on maximal dual feasible functions. - Jürgen Rietz; Cláudio Alves; José M. Valério de Carvalho (Oper. Res. Lett., 2010)

Heuristics with Stochastic Neighborhood Structures for Two-Dimensional Bin Packing and Cutting Stock Problems. - T. M. Chan; Filipe Pereira Alvelos; Elsa Silva; José M. Valério de Carvalho (Asia Pac. J. Oper. Res., 2011)

Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model. - Rita Macedo; Cláudio Alves; José M. Valério de Carvalho; François Clautiaux; Saïd Hanafi (Eur. J. Oper. Res., 2011)

Exact and heuristic approaches for lot splitting and scheduling on identical parallel machines. - Carina Maria Oliveira Pimentel; Filipe Pereira Alvelos; António J. S. T. Duarte; José M. Valério de Carvalho (Int. J. Manuf. Technol. Manag., 2011)

New Stabilization Procedures for the Cutting Stock Problem. - François Clautiaux; Cláudio Alves; José M. Valério de Carvalho; Jürgen Rietz (INFORMS J. Comput., 2011)

A Column Generation Approach for the Bi-objective Max-min Knapsack Problem. - Cláudio Alves; Raïd Mansi; Telmo Pinto 001; José M. Valério de Carvalho (ICORES, 2012)

Generalized Disaggregation Algorithm for the Vehicle Routing Problem with Time Windows and Multiple Routes. - Rita Macedo; Saïd Hanafi; François Clautiaux; Cláudio Alves; José M. Valério de Carvalho (ICORES, 2012)

Computing Valid Inequalities for General Integer Programs using an Extension of Maximal Dual Feasible Functions to Negative Arguments. - Jürgen Rietz; Cláudio Alves; José M. Valério de Carvalho; François Clautiaux (ICORES, 2012)

New constructive algorithms for leather nesting in the automotive industry. - Cláudio Alves; Pedro Brás; José M. Valério de Carvalho; Telmo Pinto 001 (Comput. Oper. Res., 2012)

Worst-case analysis of maximal dual feasible functions. - Jürgen Rietz; Cláudio Alves; José M. Valério de Carvalho (Optim. Lett., 2012)

On the extremality of maximal dual feasible functions. - Jürgen Rietz; Cláudio Alves; José M. Valério de Carvalho (Oper. Res. Lett., 2012)

A Hybrid Heuristic Based on Column Generation for Two- and Three- Stage Bin Packing Problems. - Filipe Pereira Alvelos; Elsa Silva; José Manuel Valério de Carvalho (ICCSA (2), 2014)

On the Properties of General Dual-Feasible Functions. - Jürgen Rietz; Cláudio Alves; José Manuel Valério de Carvalho; François Clautiaux (ICCSA (2), 2014)

Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem. - Cláudio Alves; José M. Valério de Carvalho; François Clautiaux; Jürgen Rietz (Eur. J. Oper. Res., 2014)

Integrating two-dimensional cutting stock and lot-sizing problems. - Elsa Silva; Filipe Pereira Alvelos; José M. Valério de Carvalho (J. Oper. Res. Soc., 2014)

A Model-Based Heuristic for the Combined Cutting Stock and Scheduling Problem. - Nuno Braga; Cláudio Alves; Rita Macedo; José M. Valério de Carvalho (ICCSA (2), 2015)

Variable Neighborhood Search for the Elementary Shortest Path Problem with Loading Constraints. - Telmo Pinto 001; Cláudio Alves; José M. Valério de Carvalho (ICCSA (2), 2015)

Fast Heuristics for Integrated Planning and Scheduling. - Jürgen Rietz; Cláudio Alves; José M. Valério de Carvalho (ICCSA (2), 2015)

Skewed general variable neighborhood search for the location routing scheduling problem. - Rita Macedo; Cláudio Alves; Saïd Hanafi; Bassem Jarboui; Nenad Mladenovic; Bruna Ramos; José M. Valério de Carvalho (Comput. Oper. Res., 2015)

Constructing general dual-feasible functions. - Jürgen Rietz; Cláudio Alves; José M. Valério de Carvalho; François Clautiaux (Oper. Res. Lett., 2015)

A Branch-and-Price Algorithm for the Vehicle Routing Problem with 2-Dimensional Loading Constraints. - Telmo Pinto 001; Cláudio Alves; José M. Valério de Carvalho (ICCL, 2016)

An exact approach based on a new pseudo-polynomial network flow model for integrated planning and scheduling. - Jürgen Rietz; Cláudio Alves; Nuno Braga; José M. Valério de Carvalho (Comput. Oper. Res., 2016)

Preface to the Special Issue on Cutting and Packing. - Antonio Miguel Gomes; José Fernando Gonçalves; Ramón Alvarez-Valdés; José M. Valério de Carvalho (Int. Trans. Oper. Res., 2016)

Variable neighborhood search algorithms for pickup and delivery problems with loading constraints. - Telmo Pinto 001; Cláudio Alves; José M. Valério de Carvalho (Electron. Notes Discret. Math., 2017)

Column generation based primal heuristics for routing and loading problems. - Telmo Pinto 001; Cláudio Alves; José M. Valério de Carvalho (Electron. Notes Discret. Math., 2018)

Column Generation Based Approaches for Combined Routing and Scheduling. - Bruna Ramos; Cláudio Alves; José M. Valério de Carvalho (Electron. Notes Discret. Math., 2018)

A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems. - John Martinovic; Guntram Scheithauer; José M. Valério de Carvalho (Eur. J. Oper. Res., 2018)

A strong integer linear optimization model to the compartmentalized knapsack problem. - John J. Quiroga-Orozco; José M. Valério de Carvalho; Robinson S. V. Hoto (Int. Trans. Oper. Res., 2019)

Variable neighborhood search algorithms for the vehicle routing problem with two-dimensional loading constraints and mixed linehauls and backhauls. - Telmo Pinto 001; Cláudio Alves; José M. Valério de Carvalho (Int. Trans. Oper. Res., 2020)

Arc flow formulations based on dynamic programming: Theoretical foundations and applications. - Vinícius Loti de Lima; Cláudio Alves; François Clautiaux; Manuel Iori; José M. Valério de Carvalho (Eur. J. Oper. Res., 2022)

An arc flow formulation to the multitrip production, inventory, distribution, and routing problem with time windows. - Bruna Ramos; Cláudio Alves; José M. Valério de Carvalho (Int. Trans. Oper. Res., 2022)

Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups. - John Martinovic; Nico Strasdat; José M. Valério de Carvalho; Fabio Furini (Optim. Lett., 2022)

A combinatorial flow-based formulation for temporal bin packing problems. - John Martinovic; Nico Strasdat; José M. Valério de Carvalho; Fabio Furini (Eur. J. Oper. Res., 2023)

A new effective heuristic for the Prisoner Transportation Problem. - Luciano Ferreira; Marcos Vinicius Milan Maciel; José M. Valério de Carvalho; Elsa Silva; Filipe Pereira Alvelos (Eur. J. Oper. Res., 2025)