Introduction - If you have any usage issues, please Google them yourself
TSP dynamic programming algorithm of a salesman to a number of cities to sell commodities, known the distance between cities (or travel). He selected from a resident, after each city again, the last resident to return to the line, making the total distance (or travel) is the smallest.
Packet : 105230289benchmark for dp.rar filelist
TSP.exe
TSP.ncb
TSP.obj
TSP.opt
旅行商问题的最优解.doc
实验2.ppt
TSP.cpp
TSP.dsp
TSP.dsw
TSP4.txt
TSP6.TXT
TSP8.TXT
TSP10.TXT
TSP15.TXT
TSP20.TXT