Well-solvable special cases of the TSP: A survey (original) (raw)

Abstract

The Traveling Salesman Problem belongs to the most important and most investigated problemsin combinatorial optimization. Although it is an NP-hard problem, many of its specialcases can be solved efficiently. We survey these special cases with emphasis on results obtainedduring the decade 1985--1995. This survey complements an earlier survey from 1985 compiledby Gilmore, Lawler and Shmoys.Keywords: Traveling Salesman Problem, Combinatorial optimization,

Vladimir Deineko hasn't uploaded this paper.

Let Vladimir know you want this paper to be uploaded.

Ask for this paper to be uploaded.