| Description |
ix, 593 p. : ill., maps ; 24 cm. |
| Series |
Princeton series in applied mathematics
|
| Bibliography |
Includes bibliographical references (p. [541]-581) and index. |
| Contents |
Preface -- ch. 1. The problem -- ch. 2. Applications -- ch. 3. Dantzig, Fulkerson, and Johnson -- ch. 4. History of TSP computation -- ch. 5. LP bounds and cutting planes -- ch. 6. Subtour cuts and PQ-trees -- ch. 7. Cuts from blossoms and blocks -- ch. 8. Combs from consecutive ones -- ch. 9. Combs from dominoes -- ch. 10. Cut metamorphoses -- ch. 11. Local cuts -- ch. 12. Managing the linear programming problems -- ch. 13. The linear programming solver -- ch. 14. Branching -- ch 15. Tour finding -- ch. 16. Computation -- ch. 17. The road goes on -- Bibliography -- Index. |
| Subject |
Traveling salesman problem.
|
| Added Author |
Applegate, David L.
|
| ISBN |
0691129932 (hardcover : alk. paper) |
|
9780691129938 (hardcover : alk. paper) |
|
