The traveling salesman problem: An overview of exact and approximate algorithms

Gilbert Laporte
1992 European Journal of Operational Research  
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.
doi:10.1016/0377-2217(92)90138-y fatcat:3brxff5cfjerhg3t4cixrqgu3u