Surprise Castle
/In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation
In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation

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

$12.99
$16.95
-23%

Out of Stock

This product is currently out of stock. Enter your email address below to be notified once the product is back in stock

Availability:Out of StockContributor:William J. CookPublish date:2014-11-09Pages:248
Languages:EnglishPublisher:Princeton University PressISBN-13:9780691163529ISBN-10:691163529UPC:9780691163529Book Category:MathematicsBook Subcategory:History & Philosophy, Optimization, AppliedSize:9.23 x 6.32 x 0.57 inchesWeight:0.9502Product ID:SCWZ61Q068

The story of one of the greatest unsolved problems in mathematics

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.
Languages:EnglishPublisher:Princeton University PressISBN-13:9780691163529ISBN-10:691163529UPC:9780691163529Book Category:MathematicsBook Subcategory:History & Philosophy, Optimization, AppliedSize:9.23 x 6.32 x 0.57 inchesWeight:0.9502Product ID:SCWZ61Q068
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).
Publisher: Princeton University Press

Contributor(s)

William J. Cook

Free shipping on orders over $75. Standard shipping takes 3-7 business days. Returns accepted within 30 days of purchase.

Recently Viewed

View All