Traveling Salesman Problem (TSP)
In this problem we are given a collection of cities as well as the
distance of
traveling between each pair of them. If a salesman starts at city A,
the TSP
consists in finding the shortest round-trip the salesman can make such
that he
visits each city exactly once and then returns to the starting city A.