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: ...
Show/Hide image

ISBN10: 0691129932, ISBN13: 9780691129938, [publisher: Princeton University Press] Hardcover Former library book; may include library markings. Used book that is in excellent condition. May show signs of wear or have minor defects.
[Mishawaka, IN, U.S.A.] [Publication Year: 2007]

ISBN10: 0691129932, ISBN13: 9780691129938, [publisher: Princeton University Press, New Jersey] Hardcover Hardcover. 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. Presents the findings on one of the most intensely investigated subjects in computational mathematics - the travelling salesman problem. This book describes the method and ...

Princeton University Press, 02/20/Date: 2007. Hardcover. Used; Good. **WE SHIP WITHIN 24 HRS FROM LONDON, UK, 98% OF OUR ORDERS ARE RECEIVED WITHIN 7-10 DAYS. We believe you will be completely satisfied with our quick and reliable service. All orders are dispatched as swiftly as possible! Buy with confidence! Greener Books. 2007. Princeton University Press ISBN 0691129932 9780691129938 [GB]