The traveling salesman problem
Subtitle: a computational study
By: David L. Applegate ... [et al.]
Contributors: Applegate, David L
Series: Princeton series in applied mathematics
Publisher: Princeton University Press
Published: 2006
Place of publication: Princeton, N.J
Language: eng
Number of pages: 593
ISBN-13: 9780691129938
Subjects: Traveling-salesman problem; Combinatorial optimization
Notes: Includes bibliographical references (p. [541]-581) and index
Table of contents: title: The problem; title: Applications; title: Dantzig, Fulkerson, and Johnson; title: History of TSP computation; title: LP bounds and cutting planes; title: Subtour cuts and PQ-trees; title: Cuts from blossoms and blocks; title: Combs from consecutive ones; title: Combs from dominoes; title: Cut metamorphoses; title: Local cuts; title: Managing the linear programming problems; title: The linear programming solver; title: Branching; title: Tour finding; title: Computation; title: The road goes on