Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- 1 December 1981
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 20 (1) , 255-282
- https://doi.org/10.1007/bf01589353
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- The vehicle routing problemRevue française d'automatique, informatique, recherche opérationnelle. Recherche opérationnelle, 1976
- Vehicle Routing Problems: Formulations and Heuristic Solution TechniquesPublished by Defense Technical Information Center (DTIC) ,1975
- A Heuristic Algorithm for the Vehicle-Dispatch ProblemOperations Research, 1974
- An Effective Heuristic Algorithm for the Traveling-Salesman ProblemOperations Research, 1973
- The traveling-salesman problem and minimum spanning trees: Part IIMathematical Programming, 1971
- The Traveling-Salesman Problem and Minimum Spanning TreesOperations Research, 1970
- Bases for Vehicle Fleet SchedulingJournal of the Operational Research Society, 1967
- Scheduling of Vehicles from a Central Depot to a Number of Delivery PointsOperations Research, 1964
- On an Integer Program for a Delivery ProblemOperations Research, 1964
- On a routing problemQuarterly of Applied Mathematics, 1958