The Library
Well-solvable special cases of the traveling salesman problem: A survey
Tools
UNSPECIFIED (1998) Well-solvable special cases of the traveling salesman problem: A survey. SIAM REVIEW, 40 (3). pp. 496-546.
Research output not available from this repository.
Request-a-Copy directly from author or use local Library Get it For Me service.
Abstract
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 | ||||
Publisher: | SIAM PUBLICATIONS | ||||
ISSN: | 0036-1445 | ||||
Official Date: | September 1998 | ||||
Dates: |
|
||||
Volume: | 40 | ||||
Number: | 3 | ||||
Number of Pages: | 51 | ||||
Page Range: | pp. 496-546 | ||||
Publication Status: | Published |
Data sourced from Thomson Reuters' Web of Knowledge
Request changes or add full text files to a record
Repository staff actions (login required)
View Item |