Advertisement
Published in:
2008 | OriginalPaper | Chapter
The Traveling Salesman Problem
Published in: Combinatorial Optimization
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
In Chapter 15 we introduced the
Traveling Salesman Problem
(TSP) and showed that it is
NP
-hard (Theorem 15.42). The TSP is perhaps the best-studied
NP
-hard combinatorial optimization problem, and there are many techniques which have been applied. We start by discussing approximation algorithms in Sections 21.1 and 21.2. In practice, so-called local search algorithms (discussed in Section 21.3) find better solutions for large instances although they do not have a finite performance ratio.