benchmark+for+DP

代码说明：

  旅行商问题动态规划算法的应用 某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（或旅费）最小。 　(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. )

文件列表：

TSP.cpp
TSP.dsp
TSP.dsw
TSP.exe
TSP.ncb
TSP.obj
TSP.opt
TSP10.TXT
TSP15.TXT
TSP20.TXT
TSP4.txt
TSP6.TXT
TSP8.TXT
实验2.ppt
旅行商问题的最优解.doc