| The Traveling Salesman Problem: A Computational Study Contributor(s): Applegate, David L. (Author), Bixby, Robert E. (Author), Chvátal, Vasek (Author) |
|
 |
ISBN: 0691129932 ISBN-13: 9780691129938 Publisher: Princeton University Press OUR PRICE: $99.75 Product Type: Hardcover - Other Formats Published: March 2007 Annotation: "This book addresses one of the most famous and important combinatorial-optimization problems--the traveling salesman problem. It is very well written, with a vivid style that captures the reader's attention. Many examples are provided that are very useful to motivate and help the reader to better understand the results presented in the book."--Matteo Fischetti, University of Padova "This is a fantastic book. Ever since the early days of discrete optimization, the traveling salesman problem has served as the model for computationally hard problems. The authors are main players in this area who forged a team in 1988 to push the frontiers on how good we are in solving hard and large traveling salesman problems. Now they lay out their views, experience, and findings in this book."--Bert Gerards, Centrum voor Wiskunde en Informatica |
| Additional Information |
| BISAC Categories: - Mathematics | Applied |
| Dewey: 511.6 |
| LCCN: 2006931528 |
| Series: Princeton Series in Applied Mathematics (Hardcover) |
| Physical Information: 1.71" H x 6.41" W x 9.45" (2.14 lbs) 608 pages |
| Descriptions, Reviews, Etc. |
| Publisher Description: 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. |