Description: Problem Statement: a salesman, n (n < = 10) cities want to sell products. Before departure in order to save travel expenses, he find out the cost of travel between any two cities, want to find a travel route, after each city only once, and the travel expenses to a minimum.
To Search:
File list (Check if you may need any files):
1 推销员问题\推销员问题(ETS算法) 实验报告.doc
............\推销员问题(ETS算法).cpp
............\推销员问题(ETS算法).exe
............\推销员问题(ETS算法).o
1 推销员问题
Download