Category "traveling-salesman"

Is there a solution to the TSP problem that is effective and not limited to space?

Is there any method of solving the traveling salesman problem effective and that is not limited by space (as is the case of the Held-Karp algorithm), excepting