Trang chủ‎ > ‎IT‎ > ‎Programming‎ > ‎Algorithms Design‎ > ‎

Traveling Salesman Problems

1. Wikipedia definition and summary:

2. Held-karp algorithm: dynamic programming algorithm to find exact solution of TSP
 the worst-case time complexity of this algorithm is {\displaystyle O(2^{n}n^{2})}O(2^{n}n^{2}) and the space {\displaystyle O(2^{n}n)}O(2^{n}n)

3. Travelling Salesman Problem | Set 1 (Naive and Dynamic Programming)

4. Travelling Salesman Problem | Set 2 (Approximate using MST)

5. Branch And Bound | Set 6 (Traveling Salesman Problem)

6. Branch and bound for symmetric and asynmmetric cost matrix with constraints

7. Soving TSP using DSP

8. Visualization examples of TSP:

9. Groups of algorithms => implemented
...