
Average Reviews:

(More customer reviews)Are you looking to buy In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation? Here is the right place to find the great deals. we can offer discounts of up to 90% on In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation. Check out the link below:
>> Click Here to See Compare Prices and Get the Best Offers
In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation ReviewThe Traveling Salesman Problem is remarkable easy to state: given a set of points with distances between them, find the shortest tour through all the points. Despite its simple statement, the problem of finding good or optimal tours has generated thousands of research papers. The TSP is the standard testbed for discrete optimization: practically every possible approach to optimization can be tried out on the TSP. So research on the TSP has had a tremendous effect on approaches for all sorts of other optimization problems. This paper covers every aspect of this research corpus.The author is the world's expert on this topic, and is clearly enraptured with this problem. His affection shows through his naming of his favorite heuristic, favorite computational model, and more. The book is wide-ranging and thorough and is written in a consistently engaging, conversational style, even when going very deep into the research literature.
This is not a research book, but it is a book about research. Through the TSP, Cook describes how research is done in a wide variety of subfields. The book requires some concentration but is accessible to any mathematically-inclined college student or bright high school student. For many, it will inspire further interest in algorithms and research.In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation Overview
Want to learn more information about In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation?
>> Click Here to See All Customer Reviews & Ratings Now