Well-solvable special cases of the traveling salesman problem: A survey
UNSPECIFIED (1998) Well-solvable special cases of the traveling salesman problem: A survey. SIAM REVIEW, 40 (3). pp. 496-546. ISSN 0036-1445Full text not available from this repository.
The traveling salesman problem (TSP) 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, Lawler, and Shmoys [The Traveling Salesman Problem-A Guided Tour of Combinatorial Optimization, Wiley, Chichester, pp. 87-143].
|Item Type:||Journal Item|
|Subjects:||Q Science > QA Mathematics|
|Journal or Publication Title:||SIAM REVIEW|
|Number of Pages:||51|
|Page Range:||pp. 496-546|
Actions (login required)