12,95 €
12,95 €
inkl. MwSt.
Sofort per Download lieferbar
12,95 €
12,95 €
inkl. MwSt.
Sofort per Download lieferbar

Alle Infos zum eBook verschenken
Als Download kaufen
12,95 €
inkl. MwSt.
Sofort per Download lieferbar
Jetzt verschenken
12,95 €
inkl. MwSt.
Sofort per Download lieferbar

Alle Infos zum eBook verschenken
  • Format: ePub

The story of one of the greatest unsolved problems in mathematicsWhat 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…mehr

  • Geräte: eReader
  • mit Kopierschutz
  • eBook Hilfe
  • Größe: 3.54MB
Produktbeschreibung
The story of one of the greatest unsolved problems in mathematicsWhat 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.
Autorenporträt
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).
Rezensionen
"Fascinating . . . describes the history, personalities, challenges, applications and techniques used to find solutions of the famous 'Traveling Salesman Problem' and related problems."--Pradeep Mutalik, Wordplay blog at New York Times