In Pursuit of the Traveling Salesman

Regular price €18.99
A01=William J. Cook
Addition
Age Group_Uncategorized
Age Group_Uncategorized
Algorithm
Algorithm engineering
Approximation
Author_William J. Cook
automatic-update
Branch and bound
Calculation
Category1=Non-Fiction
Category=PBCD
Category=PBU
Category=PDZ
Chimpanzee
Complexity
Computation
Computer
Computer science
Computer scientist
Computing
Conjecture
Convex hull
COP=United States
Customer
Cutting-plane method
Delivery_Delivery within 10-20 working days
DIMACS
Discrete mathematics
Engineering
eq_isMigrated=2
eq_non-fiction
eq_science
Estimation
Exponential growth
Feasible region
Geometry
George Dantzig
Hamiltonian path
Heuristic method
Icosian
Illustration
Instance (computer science)
Integer programming
Integrated circuit
Iteration
Jack Edmonds
Jute
Karl Menger
Kneiphof
Language_English
Lecture
Linear programming
Machine
Mathematical optimization
Mathematician
Mathematics
Model of computation
Operations research
Optimization problem
P versus NP problem
PA=Available
Participant
Price_€10 to €20
Printed circuit board
Probability
PS=Active
Quantity
RAND Corporation
Rand McNally
Result
Scan chain
Scheduling (computing)
Search tree
Simplex algorithm
softlaunch
Solder
Solver
Source code
Subset
Technology
Test set
Theorem
Time complexity
Travelling salesman problem
Turing machine
Variable (computer science)
Variable (mathematics)

Product details

  • ISBN 9780691163529
  • Weight: 425g
  • Dimensions: 152 x 235mm
  • Publication Date: 09 Nov 2014
  • Publisher: Princeton University Press
  • Publication City/Country: US
  • Product Form: Paperback
  • Language: English
Delivery/Collection within 10-20 working days

Our Delivery Time Frames Explained
2-4 Working Days: Available in-stock

10-20 Working Days: On Backorder

Will Deliver When Available: On Pre-Order or Reprinting

We ship your order once all items have arrived at our warehouse and are processed. Need those 2-4 day shipping items sooner? Just place a separate order for them!

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.
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).