The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)
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, and implementing everything in an extremely well-written computer program, the authors show how research in computational combinatorial optimization should be done."--Michael Trick,Operations Research Letters"The book is certainly a must for every researcher in practical TSP-computation."--Ulrich Faigle,Mathematical Reviews"It is very well written and clearly structured. Many examples are provided, which help the reader to better understand the presented results. The authors succeed in describing the TSP problem, beginning with its history, and the first approaches, and ending with the state of the art."--Stefan Nickel,Zentralblatt MATH"[T]the text read[s] more like a best-seller than a tome of mathematics. . . . The resulting book provides not only a map for understanding TSP computation, but should be the starting point for anyone interested in launching a computational assault on any combinatorial optimization problem."--Jan Karel Lenstra,SIAM Review"By bringing together the best work from a wide array of researchers, advancing the field where needed, describing their findings in a book, and implementing everything in an extremely well-written computer program, the authors show how research in computational combinatorial optimization should be done."--Michael Trick,ScienceDirect"[T]he book provides a comprehensive treatment of the traveling salesman problem and I highly recommend it not only to specialists in the area but to anyone interested in combinatorial optimization."--EMS Newsletter