The Held-Karp algorithm's O(2^n * n^2) bound describes worst-case time, not the tractability of TSP ...