## In Pursuit of the Traveling Salesman: |

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.
"Fascinating . . . describes the history, personalities, challenges, applications and techniques used to find solutions of the famous 'Traveling Salesman Problem' and related problems." "The Traveling Salesman Problem, or TSP, might seem to be of purely recreational interest . . . but in fact, as William J. Cook's "The author, William Cook, writes in an easy to understand style and explores the various algorithms and branches of mathematics used to solve TSP, including the branch of mathematics known as linear programming, which is known to most of us through grade school algebra and word problems. . . . "Along with a heady dose of algorithms, Cook also offers a diverting survey of the lore and history of the TSP. . . . The new volume addresses a wider audience [than
| |||||||||

### For ebooks:
| |||||||||

| |||||||||

| |||||||||

Questions and comments to: webmaster@press.princeton.edu |

Send me emails about new books in: | |

Mathematics | |

History of Science and Medicine, Philosophy of Science | |

Popular Science | |

Computer Science | |

More Choices |