Skip to main content

Presented to you through Paradigm Publishing Services

Princeton University Press

Visit our Partner Page See all our books

Chapter

Chapter 1. The Problem

You are currently not able to access this content.

You are currently not able to access this content.

Chapters in this book

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

The Traveling Salesman Problem

This chapter is in the book The Traveling Salesman Problem

https://doi.org/10.1515/9781400841103.1

Chapters in this book

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

Downloaded on 1.5.2026 from https://www.degruyterbrill.com/document/doi/10.1515/9781400841103.1/html?lang=en