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 mathematicsaand it has defied solution to this day. In this book, William Cook takes readers on a mathematical excursion, picking up the salesmanas trail in the 1800s when Irish mathematician W. R. Hamilton first defined the problem, and venturing to the furthest limits of todayas 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.The power k can be any value, such as 2, 3, or more, but it must be a fixed numberait cannot increase as n gets ... we have calculated the running times for a few values of n, assuming a computer can handle 109 instructions per second ... The precise good/bad dichotomy creates real targets for mathematicians, fueling great interest in computational issues. ... Image courtesy of Randall Munroe, xkcd.com.
|Title||:||In Pursuit of the Traveling Salesman|
|Author||:||William J. Cook|
|Publisher||:||Princeton University Press - 2011-12-27|