Projection results for vehicle routing
- 12 October 2005
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 105 (2-3) , 251-274
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow FormulationOperations Research, 2004
- Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing ProblemLecture Notes in Computer Science, 2004
- A branch and cut approach to the cardinality constrained circuit problemMathematical Programming, 2002
- A polyhedral study of the asymmetric traveling salesman problem with time windowsNetworks, 2000
- Polyhedral Theory for Arc Routing Problems2000
- Solving Multiple Knapsack Problems by Cutting PlanesSIAM Journal on Optimization, 1996
- A result on projection for the vehicle routing problemEuropean Journal of Operational Research, 1995
- Chapter 2 Time constrained routing and scheduling1995
- A catalog of steiner tree formulationsNetworks, 1993
- A generalized assignment heuristic for vehicle routingNetworks, 1981