"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. Cook examines the origins and history of the salesman problem and explores its many important applications, from genome sequencing and designing computer processors to arranging music and hunting for planets. He looks at how computers stack up against the traveling salesman problem on a grand scale, and discusses how humans, unaided by computers, go about trying to solve the puzzle. Cook traces the salesman problem to the realms of neuroscience, psychology, and art, and he also challenges readers to tackle the problem themselves. The traveling salesman problem is--literally--a $1 million question. That's the prize the Clay Mathematics Institute is offering to anyone who can solve the problem or prove that it can't be done. 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"--.

• Cover
• In Pursuit of the Traveling Salesman
• Title
• Copyright
• Contents
• Preface
• 1 Challenges
  • Tour of the United States
  • An Impossible Task?
  • One Problem at a Time
  • Road Map of the Book
• 2 Origins of the Problem
  • Before the Mathematicians
  • Euler and Hamilton
  • Vienna to Harvard to Princeton
  • And on to the RAND Corporation
  • A Statistical View
• 3 The Salesman in Action
  • Road Trips
  • Mapping Genomes
  • Aiming Telescopes, X-rays, and Lasers
  • Guiding Industrial Machines
  • Organizing Data
  • Tests for Microprocessors
  • Scheduling Jobs
  • And More
• 4 Searching for a Tour
  • The 48-States Problem
  • Growing Trees and Tours
  • Alterations While You Wait
  • Borrowing from Physics and Biology
  • The DIMACS Challenge
  • Tour Champions
• 5 Linear Programming
  • General-Purpose Model
  • The Simplex Algorithm
  • Two for the Price of One: LP Duality
  • The Degree LP Relaxation of the TSP
  • Eliminating Subtours
  • A Perfect Relaxation
  • Integer Programming
  • Operations Research
• 6 Cutting Planes
  • The Cutting-Plane Method
  • A Catalog of TSP Inequalities
  • The Separation Problem
  • Edmonds’s Glimpse of Heaven
  • Cutting Planes for Integer Programming
• 7 Branching
  • Breaking Up
  • The Search Party
  • Branch-and-bound for Integer Programming
• 8 Big Computing
  • World Records
  • The TSP on a Grand Scale
• 9 Complexity
  • A Model of Computation
  • The Campaign of Jack Edmonds
  • Cook’s Theorem and Karp’s List
  • State of the TSP
  • Do We Need Computers?
• 10 The Human Touch
  • Humans versus Computers
  • Tour-finding Strategies
  • The TSP in Neuroscience
  • Animals Solving the TSP
• 11 Aesthetics
  • Julian Lethbridge
  • Jordan Curves
  • Continuous Lines
  • Art and Mathematics
• 12 Pushing the Limits
• Notes
• Bibliography
• Index