Traveling Salesman Problem
a NP-complexity problem that is:
"given a finite number of 'cities' along with the cost of travel between each pair of them, find the cheapest way of visiting all the cities and returning to your starting point."
For more info ...