An effective implementation of the Lin–Kernighan traveling salesman heuristic
Top Cited Papers
- 1 October 2000
- journal article
- research article
- Published by Elsevier in European Journal of Operational Research
- Vol. 126 (1), 106-130
- https://doi.org/10.1016/s0377-2217(99)00284-2
Abstract
No abstract availableKeywords
This publication has 37 references indexed in Scilit:
- Local optimization and the Traveling Salesman ProblemPublished by Springer Nature ,2005
- 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
- Leaper graphsThe Mathematical Gazette, 1994
- Quick updates for p-opt TSP heuristicsOperations Research Letters, 1992
- Generating Travelling-Salesman Problems with Known Optimal ToursJournal of the Operational Research Society, 1988
- Accelerated branch exchange heuristics for symmetric traveling salesman problemsNetworks, 1987
- The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization.Journal of the Operational Research Society, 1986
- Algorithms for Large-scale Travelling Salesman ProblemsJournal of the Operational Research Society, 1972
- The shortest path through many pointsMathematical Proceedings of the Cambridge Philosophical Society, 1959