Kapitel in diesem Buch

1. Frontmatter i
2. Contents vii
3. Preface xi
4. Chapter 1. The Problem 1
5. Chapter 2. Applications 59
6. Chapter 3. Dantzig, Fulkerson, and Johnson 81
7. Chapter 4. History of TSP Computation 93
8. Chapter 5. LP Bounds and Cutting Planes 129
9. Chapter 6. Subtour Cuts and PQ-Trees 159
10. Chapter 7. Cuts from Blossoms and Blocks 185
11. Chapter 8. Combs from Consecutive Ones 199
12. Chapter 9. Combs from Dominoes 221
13. Chapter 10. Cut Metamorphoses 241
14. Chapter 11. Local Cuts 271
15. Chapter 12. Managing the Linear Programming Problems 345
16. Chapter 13. The Linear Programming Solver Chapter 14. Branching 373
17. Chapter 14. Branching 411
18. Chapter 15. Tour Finding 425
19. Chapter 16. Computation 489
20. Chapter 17. The Road Goes On 531
21. Bibliography 541
22. Index 583