The Traveling Salesman Problem
A Computational Study
- List Price$92.50
- Your price$73.99
Save $18.51 (20% off) and earn Kobo Super Points!
You'll see how many points you'll earn before checking out. We'll award them after completing your purchase.
Or, get it for 38000 Kobo Super Points!
See if you have enough points for this eBook. Sign in
This book presents the latest findings on one of the most intensely investigated subjects in computational mathematics--the traveling salesman problem. It sounds simple enough: given a set of cities and the cost of travel between each pair of them, the problem challenges you to find the cheapest route by which to visit all the cities and return home to where you began. Though seemingly modest, this exercise has inspired studies by mathematicians, chemists, and physicists. Teachers use it in the classroom. It has practical applications in genetics, telecommunications, and neuroscience.
The authors of this book are the same pioneers who for nearly two decades have led the investigation into the traveling salesman problem. They have derived solutions to almost eighty-six thousand cities, yet a general solution to the problem has yet to be discovered. Here they describe the method and computer code they used to solve a broad range of large-scale problems, and along the way they demonstrate the interplay of applied mathematics with increasingly powerful computing platforms. They also give the fascinating history of the problem--how it developed, and why it continues to intrigue us.
- Princeton University Press, September 2011
Princeton University Press
- Download options:
- EPUB 2 (Adobe DRM)
You can read this item using any of the following Kobo apps and devices: