The traveling salesman problem: An overview of exact and approximate algorithms
- 1 June 1992
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 59 (2) , 231-247
- https://doi.org/10.1016/0377-2217(92)90138-y
Abstract
No abstract availableKeywords
This publication has 57 references indexed in Scilit:
- Exact Solution of Large Asymmetric Traveling Salesman ProblemsScience, 1991
- Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraintsOperations Research Letters, 1991
- A Combinatorial Optimization Problem Arising in Dartboard DesignJournal of the Operational Research Society, 1991
- Classification of travelling salesman problem formulationsOperations Research Letters, 1990
- Probabilistic exchange algorithms and Euclidean traveling salesman problemsOR Spectrum, 1986
- Using simulated annealing to solve routing and location problemsNaval Research Logistics Quarterly, 1986
- Optimization by Simulated AnnealingScience, 1983
- Heuristic for the Hamiltonian Path Problem in Euclidian Two SpaceJournal of the Operational Research Society, 1979
- Finding optimum branchingsNetworks, 1977
- Algorithms for Large-scale Travelling Salesman ProblemsJournal of the Operational Research Society, 1972