| Name: Â
Description: The Traveling Salesman Problem . This is a “typical� NP-Complete problemwith no known (expected?) polynomial-time solution. By 1990problems in VLSI fabrication were asking for good
Category: Traveling Salesman
Url: http://www.cs.uml.edu/~giam/91.510/Lectures/Lecture6.ppt
Date: Aug 23, 2005
Current Rating: 0.00
Clicks/Hits Received: 0
Number of Reviews/Comments: 0 |
