What is the fastest algorithm for TSP? Maybe someone know the fastest solution according to computer calculations. For example WinQSB calculates 60 cities in 2-3 seconds of Intel Core 2, 2 GHz 2 Gb memory. At this moment I am reviewing Branch and Bound one. My goal is the fastest calculation the optimal (the shortest) path between n points (I have distances between points, distance between point A and B does not equal the distance between B and A, so anyway it requires asymmetric TSP algorithm).

Thank you for any help.

What is the fastest algorithm for asymmetric TSP? Maybe someone knows the fastest solution according to computer calculations. For example, WinQSB calculates 60 cities in 2-3 seconds on Intel Core 2, 2 GHz 2 Gb memory. At this moment I am reviewing Branch and Bound. My goal is the fastest calculation of the optimal (the shortest) path between $n$ points (I have distances between points; the distance from A to B does not equal the distance from B to A, so it's an asymmetric TSP).

Thank you for any help.

What is the fastest algorithm for TSP? Maybe someone know the fastest solution according to computer calculations. For example WinQSB calculates 60 cities in 2-3 seconds of Intel Core 2, 2 GHz 2 Gb memory. At this moment I am reviewing Branch and Bound one. My goal is the fastest calculation the optimal path between n cities (I have distances between them).

Thank you for any help.

What is the fastest algorithm for TSP? Maybe someone know the fastest solution according to computer calculations. For example WinQSB calculates 60 cities in 2-3 seconds of Intel Core 2, 2 GHz 2 Gb memory. At this moment I am reviewing Branch and Bound one. My goal is the fastest calculation the optimal (the shortest) path between n points (I have distances between points, distance between point A and B does not equal the distance between B and A, so anyway it requires asymmetric TSP algorithm).

Thank you for any help.