Traveling Salesmen Problem

[junjieliang]

...what is the current optimum algorithm to solve the TSP?

The current optimum algorithm is...well... brute force with good pruning. The TSP problem is NP, so there's really no good algorithm for solving it. Do tell me if you manage to find any though...

[Miguel Angel]

O (n^2 (2^n) ) with DP, although is NP as u can see by the number of operations