And even the most unrelenting brute-force attack on the traveling salesman problem (TSP) might not be enough. Finding the shortest way around a 33-city route would require calculating the distances ...

This algorithm is faster than the original r-optimal method, and computation times increase much less rapidly with problem size. The new algorithm makes it possible to solve large-scale travelling ...