Cláudio Alves

Orcid: 0000-0002-4017-1184

According to our database1, Cláudio Alves authored at least 41 papers between 2007 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Solving the integrated planning and scheduling problem using variable neighborhood search based algorithms.
Expert Syst. Appl., October, 2023

An Exact Optimization Approach for Personnel Scheduling Problems in the Call Center Industry.
Proceedings of the Computational Science and Its Applications - ICCSA 2023 Workshops, 2023

2022
An arc flow formulation to the multitrip production, inventory, distribution, and routing problem with time windows.
Int. Trans. Oper. Res., 2022

Arc flow formulations based on dynamic programming: Theoretical foundations and applications.
Eur. J. Oper. Res., 2022

2021
Dental Image Segmentation by Clustering Methods.
Proceedings of the Advanced Research in Technologies, Information, Innovation and Sustainability, 2021

2020
Variable neighborhood search algorithms for the vehicle routing problem with two-dimensional loading constraints and mixed linehauls and backhauls.
Int. Trans. Oper. Res., 2020

Evaluating the behaviour of stream learning algorithms for detecting invasion on wireless networks.
Int. J. Secur. Networks, 2020

2018
Column Generation Based Approaches for Combined Routing and Scheduling.
Electron. Notes Discret. Math., 2018

Column generation based primal heuristics for routing and loading problems.
Electron. Notes Discret. Math., 2018

2017
Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints.
Eur. J. Oper. Res., 2017

Variable neighborhood search algorithms for pickup and delivery problems with loading constraints.
Electron. Notes Discret. Math., 2017

Exact Solution of the Multi-trip Inventory Routing Problem using a Pseudo-polynomial Model.
Proceedings of the 6th International Conference on Operations Research and Enterprise Systems, 2017

Job shop schedules analysis in the context of industry 4.0.
Proceedings of the International Conference on Engineering, Technology and Innovation, 2017

Variable Neighborhood Search for Integrated Planning and Scheduling.
Proceedings of the Computational Science and Its Applications - ICCSA 2017, 2017

2016
An exact approach based on a new pseudo-polynomial network flow model for integrated planning and scheduling.
Comput. Oper. Res., 2016

A Branch-and-Price Algorithm for the Vehicle Routing Problem with 2-Dimensional Loading Constraints.
Proceedings of the Computational Logistics - 7th International Conference, 2016

2015
Constructing general dual-feasible functions.
Oper. Res. Lett., 2015

Skewed general variable neighborhood search for the location routing scheduling problem.
Comput. Oper. Res., 2015

Fast Heuristics for Integrated Planning and Scheduling.
Proceedings of the Computational Science and Its Applications - ICCSA 2015, 2015

Variable Neighborhood Search for the Elementary Shortest Path Problem with Loading Constraints.
Proceedings of the Computational Science and Its Applications - ICCSA 2015, 2015

A Model-Based Heuristic for the Combined Cutting Stock and Scheduling Problem.
Proceedings of the Computational Science and Its Applications - ICCSA 2015, 2015

2014
Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem.
Eur. J. Oper. Res., 2014

On the Properties of General Dual-Feasible Functions.
Proceedings of the Computational Science and Its Applications - ICCSA 2014 - 14th International Conference, Guimarães, Portugal, June 30, 2014

2012
On the extremality of maximal dual feasible functions.
Oper. Res. Lett., 2012

Worst-case analysis of maximal dual feasible functions.
Optim. Lett., 2012

New constructive algorithms for leather nesting in the automotive industry.
Comput. Oper. Res., 2012

Imagem e privacidade: contradições no Facebook.
Proceedings of the 11th Brazilian Symposium on Human Factors in Computing Systems, 2012

Computing Valid Inequalities for General Integer Programs using an Extension of Maximal Dual Feasible Functions to Negative Arguments.
Proceedings of the ICORES 2012, 2012

Generalized Disaggregation Algorithm for the Vehicle Routing Problem with Time Windows and Multiple Routes.
Proceedings of the ICORES 2012, 2012

A Column Generation Approach for the Bi-objective Max-min Knapsack Problem.
Proceedings of the ICORES 2012, 2012

2011
New Stabilization Procedures for the Cutting Stock Problem.
INFORMS J. Comput., 2011

Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model.
Eur. J. Oper. Res., 2011

2010
Theoretical investigations on maximal dual feasible functions.
Oper. Res. Lett., 2010

Arc-flow model for the two-dimensional guillotine cutting stock problem.
Comput. Oper. Res., 2010

A survey of dual-feasible and superadditive functions.
Ann. Oper. Res., 2010

2009
New lower bounds based on column generation and constraint programming for the pattern minimization problem.
Comput. Oper. Res., 2009

Exact Algorithms for Vehicle Routing Problems with Different Service Constraints.
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2008
A branch-and-price-and-cut algorithm for the pattern minimization problem.
RAIRO Oper. Res., 2008

New integer programming formulations and an exact algorithm for the ordered cutting stock problem.
J. Oper. Res. Soc., 2008

A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem.
Comput. Oper. Res., 2008

2007
Accelerating column generation for variable sized bin-packing problems.
Eur. J. Oper. Res., 2007


  Loading...