In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation

Voorkant
Princeton University Press, 27 dec. 2011 - 248 pagina's

What is the shortest possible route for a traveling salesman seeking to visit each city on a list exactly once and return to his city of origin? It sounds simple enough, yet the traveling salesman problem is one of the most intensely studied puzzles in applied mathematics—and it has defied solution to this day. In this book, William Cook takes readers on a mathematical excursion, picking up the salesman's trail in the 1800s when Irish mathematician W. R. Hamilton first defined the problem, and venturing to the furthest limits of today’s state-of-the-art attempts to solve it. He also explores its many important applications, from genome sequencing and designing computer processors to arranging music and hunting for planets.

In Pursuit of the Traveling Salesman travels to the very threshold of our understanding about the nature of complexity, and challenges you yourself to discover the solution to this captivating mathematical problem.

Some images inside the book are unavailable due to digital copyright restrictions.

 

Wat mensen zeggen - Een review schrijven

We hebben geen reviews gevonden op de gebruikelijke plaatsen.

Geselecteerde pagina's

Inhoudsopgave

1 Challenges
1
2 Origins of the Problem
19
3 The Salesman in Action
44
4 Searching for a Tour
62
5 Linear Programming
94
6 Cutting Planes
127
7 Branching
146
8 Big Computing
153
9 Complexity
168
10 The Human Touch
191
11 Aesthetics
199
12 Pushing the Limits
211
Notes
213
Bibliography
223
Index
225
Copyright

Overige edities - Alles weergeven

Veelvoorkomende woorden en zinsdelen

Over de auteur (2011)

William J. Cook is professor of combinatorics and optimization at the University of Waterloo. He is the coauthor of The Traveling Salesman Problem: A Computational Study (Princeton).

Bibliografische gegevens