Neighborhood search algorithms for guaranteeingoptimal traveling salesman tours must be inefficient
- 1 February 1976
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 12 (1) , 25-35
- https://doi.org/10.1016/s0022-0000(76)80016-5
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- The Traveling Salesman Problem: A SurveyOperations Research, 1968
- Computer Solutions of the Traveling Salesman ProblemBell System Technical Journal, 1965
- Discrete OptimizingJournal of the Society for Industrial and Applied Mathematics, 1965
- A Heuristic Approach to Solving Travelling Salesman ProblemsManagement Science, 1964
- A Method for Solving Traveling-Salesman ProblemsOperations Research, 1958
- The Traveling-Salesman ProblemOperations Research, 1956