Well-solvable special cases of the Traveling Salesman Problem : a survey

R.E. Burkard, V.G. Deineko, R. Dal, van, J.A.A. Veen, van der, G.J. Woeginger

Research output: Contribution to journalArticleAcademicpeer-review

133 Citations (Scopus)
598 Downloads (Pure)


The traveling salesman problem (TSP) belongs to the most basic, most important, and most investigated problems in combinatorial optimization. Although it is an ${\cal 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].
Original languageEnglish
Pages (from-to)496-546
JournalSIAM Review
Issue number3
Publication statusPublished - 1998


Dive into the research topics of 'Well-solvable special cases of the Traveling Salesman Problem : a survey'. Together they form a unique fingerprint.

Cite this