Dictionary of Computer and Internet Terms: Traveling Salesman Problem
Traveling Salesman Problem
the mathematical problem of finding the shortest route that connects n points, given the distances between the points. As far as is known, this problem can be solved only by exhaustive search, which can take a gigantic number of steps.
