"Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city and returns to the origin city?" TSP is an NP-hard problem in combinatorial optimization, important in operations research and theoretical computer science.