As of Sept 2024, this page has been moved to the Computer Science category, hereplugin-autotooltip__plain plugin-autotooltip_bigTravelling Salesman Problem

The Travelling Salesman (TSP) is a problem of Theoretical Computer Science and Graph Optimization.

"Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city just once and returns to the origin city?".