Chained Lin-Kernighan for Large Traveling Salesman Problems
- 1 February 2003
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 15 (1) , 82-92
- https://doi.org/10.1287/ijoc.15.1.82.15157
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Local optimization and the Traveling Salesman ProblemPublished by Springer Nature ,2005
- An effective implementation of the Lin–Kernighan traveling salesman heuristicEuropean Journal of Operational Research, 2000
- The Random Link Approximation for the Euclidean Traveling Salesman ProblemJournal de Physique I, 1997
- Finite Size and Dimensional Dependence in the Euclidean Traveling Salesman ProblemPhysical Review Letters, 1996
- Data Structures for Traveling SalesmenJournal of Algorithms, 1995
- On the Significance of the Initial Solution in Travelling Salesman HeuristicsJournal of the Operational Research Society, 1994
- A modified Lin-Kernighan traveling-salesman heuristicOperations Research Letters, 1993
- Large travelling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computationOperations Research Letters, 1989
- A sweepline algorithm for Voronoi diagramsAlgorithmica, 1987
- The shortest path through many pointsMathematical Proceedings of the Cambridge Philosophical Society, 1959