Traveling salesman problem
Traveling salesman problem is a problem where a salesman is to travel to N cities, once each, and to return to initial city. The problem is to find the shortest tour. Here is a TSP program that use asynchronous parallel simulated annealing method implement with multiple threads.