Travelling Salesman Problem
What is the shortest possible route that visits each city exactly once and returns to the origin city?
