| Name: Challenge Traveling Tournament Problems
Description: One aspect of the hardness of this problem is the embedded traveling salesman aspects. To explore this effect"circular distance" matrices have a trivialunique TSP solution. Number the n nodes 0
Category: Traveling Distance
Url: http://mat.gsia.cmu.edu/TOURN
Date: Aug 23, 2005
Current Rating: 0.00
Clicks/Hits Received: 0
Number of Reviews/Comments: 0 |
