 |
|
|
Item Details
| Title:
|
THE TRAVELING SALESMAN PROBLEM
A COMPUTATIONAL STUDY |
| By: |
David L. Applegate, Robert E. Bixby, Vasek Chvatal |
| Format: |
Hardback |
| List price:
|
£76.00 |
| Our price: |
£60.80 |
| Discount: |
|
| You save:
|
£15.20 |
|
|
|
|
|
| ISBN 10: |
0691129932 |
| ISBN 13: |
9780691129938 |
| Availability: |
Usually dispatched within 1-3 weeks.
 Delivery
rates
|
| Stock: |
Currently 0 available |
| Publisher: |
PRINCETON UNIVERSITY PRESS |
| Pub. date: |
15 January, 2007 |
| Series: |
Princeton Series in Applied Mathematics |
| Pages: |
608 |
| Description: |
Presents the findings on one of the most intensely investigated subjects in computational mathematics - the travelling salesman problem. This book describes the method and computer code used to solve a range of large-scale problems, and demonstrates the interplay of applied mathematics with increasingly powerful computing platforms. |
| Synopsis: |
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. |
| Illustrations: |
200 line illus. |
| Publication: |
US |
| Imprint: |
Princeton University Press |
| Prizes: |
Winner of Lanchester Prize, Informs 2007 |
| Returns: |
Returnable |
|
|
|
 |
|
|
|
|
|
No Cheese, Please!
A fun picture book for children with food allergies - full of friendship and super-cute characters!Little Mo the mouse is having a birthday party.
|
My Brother Is a Superhero
Luke is massively annoyed about this, but when Zack is kidnapped by his arch-nemesis, Luke and his friends have only five days to find him and save the world...
|
|
|
|
|