On the worst‐case performance of some heuristics for the vehicle routing and scheduling problem with time window constraints
- 1 June 1986
- Vol. 16 (2) , 161-174
- https://doi.org/10.1002/net.3230160205
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- On the worst‐case performance of some algorithms for the asymmetric traveling salesman problemNetworks, 1982
- Complexity of vehicle routing and scheduling problemsNetworks, 1981
- Worst-Case Analysis of Heuristic AlgorithmsManagement Science, 1980
- Tight bounds for christofides' traveling salesman heuristicMathematical Programming, 1978
- An Analysis of Several Heuristics for the Traveling Salesman ProblemSIAM Journal on Computing, 1977
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate AlgorithmsManagement Science, 1977
- A Computational Modification to the Savings Method of Vehicle SchedulingJournal of the Operational Research Society, 1970