A set‐partitioning‐based exact algorithm for the vehicle routing problem
- 1 December 1989
- Vol. 19 (7) , 731-749
- https://doi.org/10.1002/net.3230190702
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Optimal Routing under Capacity and Distance RestrictionsOperations Research, 1985
- Routing with time windows by column generationNetworks, 1984
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxationsMathematical Programming, 1981
- Set partitioning based heuristics for interactive routingNetworks, 1981
- A generalized assignment heuristic for vehicle routingNetworks, 1981
- An Integer Programming Approach to the Vehicle Scheduling ProblemJournal of the Operational Research Society, 1976
- A Heuristic Algorithm for the Vehicle-Dispatch ProblemOperations Research, 1974
- Improved Combinatorial Programming Algorithms for a Class of All-Zero-One Integer Programming ProblemsManagement Science, 1973
- 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