Relaxed tours and path ejections for the traveling salesman problem
- 16 April 1998
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 106 (2-3) , 522-538
- https://doi.org/10.1016/s0377-2217(97)00288-9
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Finding a best traveling salesman 4-opt move in the same time as a best 2-opt moveJournal of Heuristics, 1996
- Tabu search for the multilevel generalized assignment problemEuropean Journal of Operational Research, 1995
- Fast Clustering AlgorithmsINFORMS Journal on Computing, 1994
- The vehicle routing problem: An overview of exact and approximate algorithmsEuropean Journal of Operational Research, 1992
- Solution of large-scale symmetric travelling salesman problemsMathematical Programming, 1991
- Generalized Networks: A Fundamental Computer-Based Planning ToolManagement Science, 1978
- The traveling-salesman problem and minimum spanning trees: Part IIMathematical Programming, 1971
- The Traveling-Salesman Problem and Minimum Spanning TreesOperations Research, 1970
- Paths, Trees, and FlowersCanadian Journal of Mathematics, 1965
- Covers and packings in a family of setsBulletin of the American Mathematical Society, 1962