On the Complexity of Local Search for the Traveling Salesman Problem
- 1 March 1977
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 6 (1) , 76-83
- https://doi.org/10.1137/0206005
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- P-Complete Approximation ProblemsJournal of the ACM, 1976
- Neighborhood search algorithms for guaranteeingoptimal traveling salesman tours must be inefficientJournal of Computer and System Sciences, 1976
- Time bounds for selectionJournal of Computer and System Sciences, 1973
- An Effective Heuristic Algorithm for the Traveling-Salesman ProblemOperations Research, 1973
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- Computer Solutions of the Traveling Salesman ProblemBell System Technical Journal, 1965
- Discrete OptimizingJournal of the Society for Industrial and Applied Mathematics, 1965