Applegate, David L.
The Traveling Salesman Problem : a Computational Study. - Princeton : Princeton University Press, 2011. - 1 online resource (606 pages) - Princeton Series in Applied Mathematics . - Princeton series in applied mathematics. .
Frontmatter -- Contents -- Preface -- Chapter 1. The Problem -- Chapter 2. Applications -- Chapter 3. Dantzig, Fulkerson, and Johnson -- Chapter 4. History of TSP Computation -- Chapter 5. LP Bounds and Cutting Planes -- Chapter 6. Subtour Cuts and PQ-Trees -- Chapter 7. Cuts from Blossoms and Blocks -- Chapter 8. Combs from Consecutive Ones -- Chapter 9. Combs from Dominoes -- Chapter 10. Cut Metamorphoses -- Chapter 11. Local Cuts -- Chapter 12. Managing the Linear Programming Problems -- Chapter 13. The Linear Programming Solver Chapter 14. Branching -- Chapter 14. Branching -- Chapter 15. Tour Finding -- Chapter 16. Computation -- Chapter 17. The Road Goes On -- Bibliography -- Index.
This book presents the latest findings on one of the most intensely investigated subjects in computational mathematics--the traveling salesman problem. It sounds simple enough: given a set of cities and the cost of travel between each pair of them, the problem challenges you to find the cheapest route by which to visit all the cities and return home to where you began. Though seemingly modest, this exercise has inspired studies by mathematicians, chemists, and physicists. Teachers use it in the classroom. It has practical applications in genetics, telecommunications, and neuroscience. The autho.
In English.
9781400841103 1400841100 0691129932 9780691129938 1283256118 9781283256117
10.1515/9781400841103 doi
22573/cttx1kn JSTOR 9453454 IEEE
Traveling salesman problem.
Probl�emes de tourn�ees.
MATHEMATICS--Graphic Methods.
MATHEMATICS--Applied.
Traveling salesman problem.
Electronic books.
Electronic books.
QA164 .T72 2011
511/.5
The Traveling Salesman Problem : a Computational Study. - Princeton : Princeton University Press, 2011. - 1 online resource (606 pages) - Princeton Series in Applied Mathematics . - Princeton series in applied mathematics. .
Frontmatter -- Contents -- Preface -- Chapter 1. The Problem -- Chapter 2. Applications -- Chapter 3. Dantzig, Fulkerson, and Johnson -- Chapter 4. History of TSP Computation -- Chapter 5. LP Bounds and Cutting Planes -- Chapter 6. Subtour Cuts and PQ-Trees -- Chapter 7. Cuts from Blossoms and Blocks -- Chapter 8. Combs from Consecutive Ones -- Chapter 9. Combs from Dominoes -- Chapter 10. Cut Metamorphoses -- Chapter 11. Local Cuts -- Chapter 12. Managing the Linear Programming Problems -- Chapter 13. The Linear Programming Solver Chapter 14. Branching -- Chapter 14. Branching -- Chapter 15. Tour Finding -- Chapter 16. Computation -- Chapter 17. The Road Goes On -- Bibliography -- Index.
This book presents the latest findings on one of the most intensely investigated subjects in computational mathematics--the traveling salesman problem. It sounds simple enough: given a set of cities and the cost of travel between each pair of them, the problem challenges you to find the cheapest route by which to visit all the cities and return home to where you began. Though seemingly modest, this exercise has inspired studies by mathematicians, chemists, and physicists. Teachers use it in the classroom. It has practical applications in genetics, telecommunications, and neuroscience. The autho.
In English.
9781400841103 1400841100 0691129932 9780691129938 1283256118 9781283256117
10.1515/9781400841103 doi
22573/cttx1kn JSTOR 9453454 IEEE
Traveling salesman problem.
Probl�emes de tourn�ees.
MATHEMATICS--Graphic Methods.
MATHEMATICS--Applied.
Traveling salesman problem.
Electronic books.
Electronic books.
QA164 .T72 2011
511/.5