TSP 行商問題 利用Dynamic programming 方法去撰寫-TSP the peddler problems utilize Dynamic programming approach to writing

文章运用m atlab语言给出了二维动态规划逆序算法的程序, 并且通过两个数值实例验证了该程序的有效性, 同时也表明了该程序对动态规划问题具有一定的通用性。-By applying m atlab language gives the two-dimensional dynamic programming algorithm reverse the procedure, and by two numerical examples demonstrate the effectiveness of