The Traveling Salesman Problem
Subtitle: A Computational Study (Princeton Series in Applied Mathematics)
Publisher: Princeton University Press
Published: January 15, 2007
Language: eng
Format: Hardcover
Number of pages: 606
ISBN-13: 9780691129938
Subjects: Applied mathematics; Mathematical theory of computation; Mathematics; Science/Mathematics; Applied; Mathematics / Applied; Physics
First sentence: Given a set of cities along with the cost of travel between each pair of them, the traveling salesman problem, or TSP for short, is to find the cheapest way of visiting all the cities and returning to the starting point.