Implementation analysis of efficient heuristic algorithms for the traveling salesman problem
- 30 April 2006
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 33 (4), 1154-1172
- https://doi.org/10.1016/j.cor.2005.06.014
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Data structures and ejection chains for solving large-scale traveling salesman problemsEuropean Journal of Operational Research, 2005
- Chained Lin-Kernighan for Large Traveling Salesman ProblemsINFORMS Journal on Computing, 2003
- An effective implementation of the Lin–Kernighan traveling salesman heuristicEuropean Journal of Operational Research, 2000
- Relaxed tours and path ejections for the traveling salesman problemEuropean Journal of Operational Research, 1998
- Data Structures for Traveling SalesmenJournal of Algorithms, 1995
- NEW EJECTION CHAIN AND ALTERNATING PATH METHODS FOR TRAVELING SALESMAN PROBLEMSPublished by Elsevier ,1992
- TSPLIB—A Traveling Salesman Problem LibraryINFORMS Journal on Computing, 1991
- A data structure useful for finding Hamiltonian cyclesTheoretical Computer Science, 1990
- An Effective Heuristic Algorithm for the Traveling-Salesman ProblemOperations Research, 1973
- The Traveling-Salesman Problem and Minimum Spanning TreesOperations Research, 1970