Princeton University Press 2/4/2007 12: 00: 00 AM Hardcover New Book. Shipped from UK in 4 to 14 days. Established seller since 2000. Please note we cannot offer an expedited shipping service from the UK.

Princeton University Press 2/4/2007 12: 00: 00 AM Hardcover PLEASE NOTE, WE DO NOT SHIP TO DENMARK. New Book. Shipped from UK in 4 to 14 days. Established seller since 2000. Please note we cannot offer an expedited shipping service from the UK.

ISBN10: 0691129932, ISBN13: 9780691129938, [publisher: Princeton University Press] Hardcover New Book. Shipped from UK. Established seller since 2000.
[Wood Dale, IL, U.S.A.] [Publication Year: 2007]

ISBN10: 0691129932, ISBN13: 9780691129938, [publisher: Princeton University Press] Hardcover New copy - Usually dispatched within 4 working days. 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.
[Southport, United Kingdom] [Publication Year: 2007]

ISBN10: 0691129932, ISBN13: 9780691129938, [publisher: Princeton University Press] Hardcover 2007. 2nd Printing. Hardcover. 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. Series: Princeton Series in Applied Mathematics. Num Pages: 608 pages, 200 line illus. BIC Classification: PBW; UYA. Category: (P) Professional & Vocational; (U) Tertiary Education (US: College). Dimension: 241 x 165 x 43. Weight in Grams: 1056. . . . . .
[Galway, GY, Ireland] [Publication Year: 2007]

ISBN10: 0691129932, ISBN13: 9780691129938, [publisher: Princeton University Press] Hardcover nach der Bestellung gedruckt Neuware - Printed after ordering - 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.
[Einbeck, Germany] [Publication Year: 2007]