Find the shortest tour that visits each city exactly once.
This problem is a very general and important one, with many applications. To see some of these applications and download code to solve this problem, visit this site.
