• Publications
  • Influence
New benchmark instances for the Capacitated Vehicle Routing Problem
The recent research on the CVRP is being slowed down by the lack of a good set of benchmark instances. The existing sets suffer from at least one of the following drawbacks: (i) became too easy forExpand
  • 116
  • 17
  • PDF
The time dependent traveling salesman problem: polyhedra and algorithm
The time dependent traveling salesman problem (TDTSP) is a generalization of the classical traveling salesman problem (TSP), where arc costs depend on their position in the tour with respect to theExpand
  • 66
  • 11
  • PDF
Improved Branch-Cut-and-Price for Capacitated Vehicle Routing
The best performing exact algorithms for the Capacitated Vehicle Routing Problem are based on the combination of cut and column generation. Some authors could obtain reduced duality gaps by alsoExpand
  • 56
  • 10
Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
This paper presents an exact algorithm for the identical parallel machine scheduling problem over a formulation where each variable is indexed by a pair of jobs and a completion time. We show thatExpand
  • 92
  • 6
Improved branch-cut-and-price for capacitated vehicle routing
The best performing exact algorithms for the capacitated vehicle routing problem developed in the last 10 years are based in the combination of cut and column generation. Some authors only used cutsExpand
  • 59
  • 5
  • PDF
Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems
This chapter presents techniques for constructing robust Branch-Cut-and-Price algorithms on a number of Vehicle Routing Problem variants. The word ‘‘robust’’ stresses the effort of controlling theExpand
  • 52
  • 4
  • PDF
Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery
Abstract We propose a branch-and-cut algorithm for the VRPSPD where the constraints that ensure that the capacities are not exceeded in the middle of a route are applied in a lazy fashion. TheExpand
  • 50
  • 4
  • PDF
Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation
The convergence of a column generation algorithm can be improved in practice by using stabilization techniques. Smoothing and proximal methods based on penalizing the deviation from the incumbentExpand
  • 37
  • 4
Efficient Algorithms for the Hotlink Assignment Problem: The Worst Case Search
Let T be a rooted directed tree where nodes represent web pages of a web site and arcs represent hyperlinks In this case, when a user searches for an information i, it traverses a directed path in T,Expand
  • 20
  • 4