# The Travelling Salesman Problem and Computational complexity

The Travelling Salesman Problem (TSP) is to find a tour of $n$ cities which minimizes the total cost of the tour.