The Traveling Salesman Problem: A Computational Study

by

Write The First Customer Review

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 ...

The Traveling Salesman Problem: A Computational Study 2006, Princeton University Press, Princeton, NJ

ISBN-13: 9780691129938

Hardcover

Select