Tiny Tour
In May 2004, the traveling salesman problem of visiting all 24,978 cities in Sweden was solved: a tour of length 855,597 TSPLIB units (approximately 72,500 kilometers) was found and it was proven that no shorter tour exists. At the time of the computation, this was the largest solved TSP instance, surpassing the previous record of 15,112 cities through Germany set in April 2001. The current record an 85,900-city tour that arose in a chip-design application.

Research Team

Support for this research was provided by the following grants