Travelling salesman
Given a list of cities and the euclidean distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city?
TravellingSalesman[cities]
Travelling salesman is an NP-hard problem in combinatorial optimization, important in operations research and theoretical computer science.