The Complexity of the Lin–Kernighan Heuristic for the Traveling Salesman Problem
- 1 June 1992
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 21 (3), 450-465
- https://doi.org/10.1137/0221030
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- On total functions, existence theorems and computational complexityTheoretical Computer Science, 1991
- Simple Local Search Problems that are Hard to SolveSIAM Journal on Computing, 1991
- Neural networks and physical systems with emergent collective computational abilities.Proceedings of the National Academy of Sciences, 1982
- An Effective Heuristic Algorithm for the Traveling-Salesman ProblemOperations Research, 1973
- An Efficient Heuristic Procedure for Partitioning GraphsBell System Technical Journal, 1970