A generalized assignment heuristic for vehicle routing
- 1 June 1981
- Vol. 11 (2), 109-124
- https://doi.org/10.1002/net.3230110205
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- The Lagrangian Relaxation Method for Solving Integer Programming ProblemsManagement Science, 1981
- Implementing vehicle routing algorithmsNetworks, 1977
- Integer programming approaches to the travelling salesman problemMathematical Programming, 1976
- A Heuristic Algorithm for the Vehicle-Dispatch ProblemOperations Research, 1974
- An Effective Heuristic Algorithm for the Traveling-Salesman ProblemOperations Research, 1973
- An Algorithm for the Vehicle-dispatching ProblemJournal of the Operational Research Society, 1969
- Bases for Vehicle Fleet SchedulingJournal of the Operational Research Society, 1967
- Computer Solutions of the Traveling Salesman ProblemBell System Technical Journal, 1965
- Scheduling of Vehicles from a Central Depot to a Number of Delivery PointsOperations Research, 1964
- Partitioning procedures for solving mixed-variables programming problemsNumerische Mathematik, 1962