A branch and bound algorithm for the capacitated vehicle routing problem
- 1 June 1983
- journal article
- research article
- Published by Springer Nature in OR Spectrum
- Vol. 5 (2) , 77-85
- https://doi.org/10.1007/bf01720015
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- A restricted Lagrangean approach to the traveling salesman problemMathematical Programming, 1981
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxationsMathematical Programming, 1981
- A generalized assignment heuristic for vehicle routingNetworks, 1981
- State‐space relaxation procedures for the computation of bounds to routing problemsNetworks, 1981
- Implementing vehicle routing algorithmsNetworks, 1977
- An Integer Programming Approach to the Vehicle Scheduling ProblemJournal of the Operational Research Society, 1976
- 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
- Partitioning procedures for solving mixed-variables programming problemsNumerische Mathematik, 1962
- Applications of Linear Programming in the Oil IndustryManagement Science, 1957