Submit an Enquiry or Call Us +44 (0) 1482 384660
Image for The Traveling Salesman Problem : A Computational Study

The Traveling Salesman Problem : A Computational Study

By: Applegate, David L. Bixby, Robert E. Chvatal, Vasek Cook, William J.

Part of the Princeton Series in Applied Mathematics series
0691129932 / 9780691129938
Hardback
04/02/2007
Stock expected by 13/08/2021
United States
152 x 235 mm, 1049 grams 608 pages, 200 line illus.
Professional & Vocational  Learn More Tertiary Education (US: College)

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.

BIC:

PBW Applied mathematics, UYA Mathematical theory of computation

Our price£60.80
RRP £76.00
Save 20%