Claudia4 / Traveling-Salesman

TSP with Branch-and-Bound algorithm by Held and Karp
0 stars 1 forks source link

Branch and Bound algorithm for TSP

@runtime: too slow -berlin52 ok -st70 approx. 2 1/2 min. -eil76 approx. 3-4 min. -lin 105 approx. 30 sec. all other instances need more time

@correctness ok