| Article ID: | iaor1996637 |
| Country: | Netherlands |
| Volume: | 59 |
| Issue: | 2 |
| Start Page Number: | 231 |
| End Page Number: | 247 |
| Publication Date: | Jun 1992 |
| Journal: | European Journal of Operational Research |
| Authors: | Laporte Gilbert |
In this paper, some of the main known algorithms for the traveling salesman problem are surveyed. The paper is organized as follows: (1) definition; (2) applications; (3) complexity analysis; (4) exact algorithms; (5) heuristic algorithms; (6) conclusion.