The Traveling Salesman Problem, “Fastest” Algorithms, and the Reality of NP-Completeness.

The Traveling Salesman Problem (TSP) is one of those rare problems that is both intuitively simple and mathematically profound. It asks a…