Cláudio Alves

44 papers C 5Journal 27Unranked 12
YearRankTypeTitle / Venue / Authors
2025 — conf
A New Improved Algorithm for a Rich Production and Routing Problem.
IN4PL (2)
Mário Leite, Telmo Pinto, Cláudio Alves
2025 — conf
Solving the Integrated Production and Routing Problem Using a Skewed Hybrid Variable Neighborhood Search Algorithm.
ICVNS
Mário Leite, Telmo Pinto, Cláudio Alves
2023 — conf
An Exact Optimization Approach for Personnel Scheduling Problems in the Call Center Industry.
ICCSA (Workshops 2)
Rita Martins, Telmo Pinto, Cláudio Alves
2023 J jnl
Solving the integrated planning and scheduling problem using variable neighborhood search based algorithms.
Expert Syst. Appl.
Mário Leite, Telmo Pinto, Cláudio Alves
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
2021 — conf
Dental Image Segmentation by Clustering Methods.
ARTIIS
Carlos Balsa, Cláudio Alves, Ronan Guivarch, Sandrine Mouysset
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
Evaluating the behaviour of stream learning algorithms for detecting invasion on wireless networks.
Int. J. Secur. Networks
Cláudio Alves, Flávia Bernardini, Edwin B. Mitacc Meza, Leandro Sousa
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
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 C conf
Exact Solution of the Multi-trip Inventory Routing Problem using a Pseudo-polynomial Model.
ICORES
Nuno Braga, Cláudio Alves, Rita Macedo
2017 J jnl
Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints.
Eur. J. Oper. Res.
François Clautiaux, Saïd Hanafi, Rita Macedo, Marie-Emilie Voge, Cláudio Alves
2017 — conf
Job shop schedules analysis in the context of industry 4.0.
ICE/ITMC
R. A. Sousa, Maria Leonilde R. Varela, Cláudio Alves, José Machado
2017 — conf
Variable Neighborhood Search for Integrated Planning and Scheduling.
ICCSA (2)
Mário Leite, Cláudio Alves, Telmo Pinto
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
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
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
2014 — conf
On the Properties of General Dual-Feasible Functions.
ICCSA (2)
Jürgen Rietz, Cláudio Alves, José Manuel Valério de Carvalho, François Clautiaux
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 — conf
Imagem e privacidade: contradições no Facebook.
IHC (Companion)
Ana Terto, Cláudio Alves, Janicy Rocha, Raquel O. Prates
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
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
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
Accelerating column generation for variable sized bin-packing problems.
Eur. J. Oper. Res.
Cláudio Alves, José M. Valério de Carvalho