Cláudio Alves - Citegraph

Author Info

Name	Affiliation	Papers
CLÁUDIO ALVES	Centro de Investigação Algoritmi da Universidade do Minho, Escola de Engenharia, Universidade do Minho, 4710-057 Braga, Portugal	33
Collaborators	Citations	PageRank
20	184	16.29
Referers	Referees	References
320	292	262

Search Limit

100320

Publications (33 rows)

Collaborators (20 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Arc flow formulations based on dynamic programming: Theoretical foundations and applications	0	0.34	2022
An Arc Flow Formulation To The Multitrip Production, Inventory, Distribution, And Routing Problem With Time Windows	0	0.34	2022
Variable Neighborhood Search Algorithms For The Vehicle Routing Problem With Two-Dimensional Loading Constraints And Mixed Linehauls And Backhauls	3	0.38	2020
Column generation based primal heuristics for routing and loading problems.	0	0.34	2018
Column Generation Based Approaches for Combined Routing and Scheduling.	0	0.34	2018
Exact Solution Of The Multi-Trip Inventory Routing Problem Using A Pseudo-Polynomial Model	0	0.34	2017
Variable neighborhood search algorithms for pickup and delivery problems with loading constraints.	2	0.38	2017
Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints.	4	0.38	2017
A Branch-and-Price Algorithm for the Vehicle Routing Problem with 2-Dimensional Loading Constraints.	1	0.38	2016
An exact approach based on a new pseudo-polynomial network flow model for integrated planning and scheduling.	0	0.34	2016
A Model-Based Heuristic For The Combined Cutting Stock And Scheduling Problem	2	0.36	2015
Fast Heuristics For Integrated Planning And Scheduling	0	0.34	2015
Variable Neighborhood Search For The Elementary Shortest Path Problem With Loading Constraints	3	0.44	2015
Skewed general variable neighborhood search for the location routing scheduling problem	6	0.59	2015
Constructing general dual-feasible functions.	0	0.34	2015
Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem.	9	0.50	2014
Worst-case analysis of maximal dual feasible functions.	4	0.42	2012
Generalized Disaggregation Algorithm for the Vehicle Routing Problem with Time Windows and Multiple Routes.	1	0.36	2012
On the extremality of maximal dual feasible functions.	1	0.37	2012
New constructive algorithms for leather nesting in the automotive industry	3	0.38	2012
Computing Valid Inequalities for General Integer Programs using an Extension of Maximal Dual Feasible Functions to Negative Arguments.	1	0.37	2012
A Column Generation Approach for the Bi-objective Max-min Knapsack Problem.	0	0.34	2012
Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model.	12	0.63	2011
New Stabilization Procedures for the Cutting Stock Problem	7	0.53	2011
A survey of dual-feasible and superadditive functions	29	1.01	2010
Theoretical investigations on maximal dual feasible functions	6	0.52	2010
Arc-flow model for the two-dimensional guillotine cutting stock problem	21	0.77	2010
New lower bounds based on column generation and constraint programming for the pattern minimization problem	7	0.52	2009
Exact Algorithms for Vehicle Routing Problems with Different Service Constraints	1	0.36	2009
New integer programming formulations and an exact algorithm for the ordered cutting stock problem	1	0.38	2008
A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem	27	1.24	2008
A branch-and-price-and-cut algorithm for the pattern minimization problem	6	0.56	2008
Accelerating column generation for variable sized bin-packing problems	27	1.42	2007