Interesting... although his explanation of TSP complexity is unfortunately incorrect (or misstated). The complexity he is describing is specifically for the nai

Interesting... although his explanation of TSP complexity is unfortunately incorrect (or misstated). The complexity he is describing is specifically for the naive brute force search [1] algorithm for finding the shortest path for TSP. And a 200 city TSP is quite solvable, and often times even by a mobile device like an iPhone 5 [2]! Indeed, no need for all the time in the universe -- lucky for companies like UPS who utilize TSP variants regularly. [1] http://en.wikipedia.org/wiki/Big_O_notation#Orders_of_common_functions http://en.wikipedia.org/wiki/Big_O_notation#Orders_of_common... [2] http://www.math.uwaterloo.ca/tsp/iphone/ http://www.math.uwaterloo.ca/tsp/iphone/