| Article ID: | iaor200973016 |
| Country: | United Kingdom |
| Volume: | 61 |
| Issue: | 1 |
| Start Page Number: | 35 |
| End Page Number: | 40 |
| Publication Date: | Jan 2010 |
| Journal: | Journal of the Operational Research Society |
| Authors: | Laporte G |
The Traveling Salesman Problem (TSP) is one of the most famous problems in combinatorial optimization. Hundreds of papers have been written on the TSP and several exact and heuristic algorithms are available for it. Their concise guide outlines the most important and best algorithms for the symmetric and asymmetric versions of the TSP. In several cases, references to publicly available software are provided.