JAVA Traveling Salesman Problem (TSP)

JAVA implementation for the symmetric Traveling Salesman Problem (TSP).
In this problem a salesperson has to find the shortest possible route to visit all the cities.
more information
See also:
Exact Traveling Salesman Problem Fast exhaustive version, runs up to 150 cities
links to related sites
combinatorics home