TSP问题的动态规划法 某售货员要到若干城市去推销商品，已知各城市之间的路程(或旅费)。他要选定一条从驻地出发，经过每个城市一次，最后回到驻地的路线，使总的路程(或总旅费)最小。-TSP problem of dynamic programming to a number of cities to a salesman to sell goods, known distance between cities (or travel). He selected a departure from the resident, after each city once, and finally back to the resident' s line, bringing the total distance (or total travel) minimum.