Travelling salesman problem

In the theory of computational complexity, 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 theoretical computer science and operations research.

Back to Route Planning & Optimization →

Source: Wikipedia · Image: Wikimedia Commons · Public domain

TOROUTE

Navigation and route-planning, made practical — plain-English guides to GPS and satellite positioning, maps and coordinates, and the geo calculators every driver, hiker, and route planner reaches for.

Get new guides by emailOccasional emails. No spam. Unsubscribe anytime.

InformationAbout Contact Privacy Policy Terms of Service Disclaimer Affiliate Disclosure Cookie Policy

Every museum entry, image, and fact is drawn from Wikipedia and Wikimedia Commons, used under public-domain and Creative Commons licenses. No content is AI-generated.