Traveling Salesman Problem

A problem in which a salesman must visit a given set of cities exactly once and return to his starting point, finding the shortest possible route.