THE TRAVELING SALESMAN PROBLEM: AN OVERVIEW OF EXACT AND APPROXIMATE ALGORITHMS

Gilbert Laporte · RePEc: Research Papers in Economics · 1991

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.

Read the paper · More papers on PaperTik