/LC.GIF&client=easterncarolinaedu)
The traveling salesman problem : a computational study / David L. Applegate [and others].
| Other author | Applegate, David L. |
| Format | Book |
| Publication Info | Princeton : Princeton University Press, ©2006. |
| Description | ix, 593 pages : illustrations, maps ; 24 cm. |
| Supplemental Content | Table of contents only |
| Subjects |
| Series | Princeton series in applied mathematics Princeton series in applied mathematics. ^A517163 |
| 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. |
| Bibliography note | Includes bibliographical references (p. [541]-581) and index. |
| LCCN | 2006931528 |
| ISBN | 0691129932 (hardcover : alk. paper) |
| ISBN | 9780691129938 (hardcover : alk. paper) |
Availability
| Library | Location | Call Number | Status | Item Actions |
|---|---|---|---|---|
| Joyner | General Stacks | QA164 .T72 2006 | ✔ Available | Place Hold |