.png){kind=logo}
Stock image for illustration purposes only - book cover, edition or condition may vary.
The Traveling Salesman Problem: A Computational Study
David L. Applegate
€ 137.39
FREE Delivery in Ireland
Description for The Traveling Salesman Problem: A Computational Study
Hardback. 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.
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 ... Read more
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 ... Read more
Product Details
Publisher
Princeton University Press United States
Number of pages
608
Format
Hardback
Publication date
2007
Series
Princeton Series in Applied Mathematics
Condition
New
Weight
1056g
Number of Pages
608
Place of Publication
New Jersey, United States
ISBN
9780691129938
SKU
V9780691129938
Shipping Time
Usually ships in 7 to 11 working days
Ref
99-1
About David L. Applegate
David L. Applegate is a researcher at AT&T Labs. Robert E. Bixby is Research Professor of Management and Noah Harding Professor of Computational and Applied Mathematics at Rice University. Vasek Chvatal is Canada Research Chair in Combinatorial Optimization at Concordia University. William J. Cook is Chandler Family Chair in Industrial and Systems Engineering at the Georgia Institute of Technology.
Reviews for The Traveling Salesman Problem: A Computational Study
Winner of the 2007 Lanchester Prize, Informs "The authors have done a wonderful job of explaining how they developed new techniques in response to the challenges posed by ever larger instances of the Traveling Salesman Problem."
MAA Online "By bringing together the best work from a wide array of researchers, advancing the field where needed, describing their findings in a book, ... Read more
MAA Online "By bringing together the best work from a wide array of researchers, advancing the field where needed, describing their findings in a book, ... Read more