According to the website below, the DP solution is O(n^2 * 2^n). That would be a big speedup. https://www.geeksforgeeks.org/travelling-salesman-problem-set-1/

According to the website below, the DP solution is O(n^2 * 2^n). That would be a big speedup. https://www.geeksforgeeks.org/travelling-salesman-problem-set-1/ https://www.geeksforgeeks.org/travelling-salesman-problem-se...