The Traveling Salesman Problem
Subtitle: A Guided Tour of Combinatorial Optimization (Wiley Series in Discrete Mathematics & Optimization)
Publisher: Wiley
Published: September 1985
Language: eng
Number of pages: 476
ISBN-13: 9780471904137
First sentence: If a salesman, starting from his home city, is to visit exactly once each city on a given list and then return home, it is plausible for him to select the order in which he visits the cities so that the total of the distances traveled in his tour is as small as possible.