Data structures and ejection chains for solving large-scale traveling salesman problems
- 1 January 2005
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 160 (1) , 154-171
- https://doi.org/10.1016/j.ejor.2004.04.023
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- Implementation analysis of efficient heuristic algorithms for the traveling salesman problemComputers & Operations Research, 2006
- Relaxed tours and path ejections for the traveling salesman problemEuropean Journal of Operational Research, 1998
- Data Structures for Traveling SalesmenJournal of Algorithms, 1995
- 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
- Computer Solutions of the Traveling Salesman ProblemBell System Technical Journal, 1965