The traveling salesman problem has been puzzling travelers, salesman, and mathematicians for awhile. According to Wikipedia, the problem is that “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?”
