#### Wednesday, March 30th, 2011

## Creating distance with Google

The Traveling Salesman Problem (TSP) is an NP-hard problem in combinatorial optimization. Given a list of cities and the distance between each pair of cities, the TSP requires finding a shortest possible tour that visits each city exactly once and returns to the starting point. The TSP is one of the most intensely studied problems […]