Contact
How to shop
Delivery
Shopping guide
Traveling Salesman Problem
A Computational Study
English
Affordable
&
affordable ▸
Up to 30 days for returns
Customers also purchased
/
Hardback
7 117
Ft
/
Paperback
14 399
Ft
/
Paperback
9 356
Ft
/
Paperback
23 182
Ft
This book presents the latest findings on one of the most intensely investigated subjects in computational mathematics - the travelling 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 travelling 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.
About the book
English
Give this book today
It's easy
1 Add to cart and choose Deliver as present at the checkout 2 We'll send you a voucher 3 The book will arrive at the recipient's addressYou might also be interested in
/
Paperback
3 362
Ft
/
Paperback
5 388
Ft
/
Paperback
3 708
Ft
/
Stationery items
4 399
Ft
/
Paperback
2 794
Ft
Hi! I'm Libroamiko, your book advisor.
How can I help you?