Research Catalog

The traveling salesman problem : a computational study

Title
The traveling salesman problem : a computational study / David L. Applegate ... [et al.].
Publication
Princeton : Princeton University Press, c2006.

Available Online

Table of contents only

Items in the Library & Off-site

Filter by

1 Item

StatusFormatAccessCall NumberItem Location
TextUse in library JBE 07-607Schwarzman Building - General Research Room 315

Details

Additional Authors
Applegate, David L.
Description
ix, 593 p. : ill., maps; 24 cm.
Series Statement
Princeton series in applied mathematics
Subject
Traveling-salesman problem
Bibliography (note)
  • Includes bibliographical references (p. [541]-581) and index.
Contents
The problem -- Applications -- Dantzig, Fulkerson, and Johnson -- History of TSP computation -- LP bounds and cutting planes -- Subtour cuts and PQ-trees -- Cuts from blossoms and blocks -- Combs from consecutive ones -- Combs from dominoes -- Cut metamorphoses -- Local cuts -- Managing the linear programming problems -- The linear programming solver -- Branching -- Tour finding -- Computation -- The road goes on.
Call Number
JBE 07-607
ISBN
  • 0691129932 (hardcover : alk. paper)
  • 9780691129938 (hardcover : alk. paper)
LCCN
2006931528
OCLC
83853510
Title
The traveling salesman problem : a computational study / David L. Applegate ... [et al.].
Imprint
Princeton : Princeton University Press, c2006.
Series
Princeton series in applied mathematics
Bibliography
Includes bibliographical references (p. [541]-581) and index.
Connect to:
Table of contents only
Added Author
Applegate, David L.
Research Call Number
JBE 07-607
View in Legacy Catalog