A Lagrangean relaxation heuristic for vehicle routing
References (13)
- et al.
Mult-terminal vehicle-dispatch algorithm
Omega
(1976) - et al.
An algorithm for the vehicle dispatching problem
Operational. Res. Quart.
(1969) - et al.
Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
Math. Programming
(1981) - et al.
Scheduling of vehicles from a central depot to a number of delivery points
Operations Res.
(1964) A method for solving traveling salesman problems
Operations Res.
(1958)- et al.
Set partitioning based heuristics for interactive routing
Networks
(1981)
There are more references available in the full text version of this article.
Cited by (0)
Copyright © 1984 Published by Elsevier B.V.