Well-solvable special cases of the traveling salesman problem: A survey

The traveling salesman problem belongs to the most basic, most important, and most investigated problems in combinatorial optimization. Although it is an NP-hard problem, many of its special cases can be solved efficiently in polynomial time. We survey these special cases with emphasis on the results that have been obtained during the decade 1985–1995. This survey complements an earlier survey from 1985 compiled by Gilmore et al.