Introduction to the Travelling Salesman Problem

TSP (Travelling Salesman Problem) is a famous problem described by the following question: 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 th...