Asymptotic expected performance of some TSP heuristics: An empirical evaluation
- 27 November 1989
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 43 (2) , 231-238
- https://doi.org/10.1016/0377-2217(89)90217-8
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Routing and scheduling of vehicles and crewsComputers & Operations Research, 1983
- A Statistical Evaluation of Multiplicative Congruential Random Number Generators with Modulus 2 31 - 1Journal of the American Statistical Association, 1982
- Approximate Traveling Salesman AlgorithmsOperations Research, 1980
- An Analysis of Several Heuristics for the Traveling Salesman ProblemSIAM Journal on Computing, 1977
- The Euclidean travelling salesman problem is NP-completeTheoretical Computer Science, 1977
- Some Simple Applications of the Travelling Salesman ProblemJournal of the Operational Research Society, 1975
- An Effective Heuristic Algorithm for the Traveling-Salesman ProblemOperations Research, 1973
- Scheduling of Vehicles from a Central Depot to a Number of Delivery PointsOperations Research, 1964