Description: TSP problem, that each of the N cities experiencing a return to the starting point, so that the shortest distance elapsed. Use continuous Hopfield networks to five cities as an example of the TSP.
To Search:
File list (Check if you may need any files):
TSP\enumeration.m
...\tsp.m
...\框图.doc
...\连续的Hopfield网络（TSP问题）.doc
TSP
Download