Travelling salesman problem - Wikipedia, the free encyclopedia Put 100 flags in a field and time people picking them up, give bonuses for shortest distance. (Part of academic-athletics)

TSP Art Two hands, one loop From a distance, it appears that Adam's finger and God's finger have just broken contact. Yet from up close, it becomes apparent that they are connected. The entire picture is comprised of a single black loop.

Traveling Salesman Problem - The travelling salesman problem (TSP) asks 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 the origin city? It is an NP-hard problem in combinatorial optimization, important in operations research and theoretical computer science. TSP is a special case of the travelling purchaser problem.