#TSP - Travelling Salesman Problem
The problem can be simplied as: "Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city?"
Its a NP-hard problem. The DP approach is O(2^n).