Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem
- 12 October 2005
- journal article
- Published by Springer Science and Business Media LLC in Mathematical Programming
- Vol. 106 (3), 491-511
- https://doi.org/10.1007/s10107-005-0644-x
Abstract
No abstract availableKeywords
This publication has 29 references indexed in Scilit:
- Stronger K-tree relaxations for the vehicle routing problemEuropean Journal of Operational Research, 2004
- Parallel branch and cut for capacitated vehicle routingParallel Computing, 2003
- On the capacitated vehicle routing problemMathematical Programming, 2003
- Multistars, partial multistars and the capacitated vehicle routing problemMathematical Programming, 2002
- Models, relaxations and exact approaches for the capacitated vehicle routing problemDiscrete Applied Mathematics, 2002
- Finding minimum congestion spanning treesACM Journal of Experimental Algorithmics, 2000
- A branch-and-cut algorithm for vehicle routing problemsAnnals of Operations Research, 1994
- A set‐partitioning‐based exact algorithm for the vehicle routing problemNetworks, 1989
- A branch and bound algorithm for the capacitated vehicle routing problemOR Spectrum, 1983
- An Algorithm for the Vehicle-dispatching ProblemJournal of the Operational Research Society, 1969