文件名称:算法设计——旅行售货员
介绍说明--下载内容均来自于网络,请自行研究使用
某售货员要到若干城市去推销商品,已知个城市之间的路程或路费,我要选定一条从驻地出发,经过每个城市一次,最后回到驻地的路线,使总的路程(或路费)最小。(回溯法)(A salesperson will sell products to several cities. The distance or distance between the known cities will be chosen. I will choose a route that starts from the station, passes through every city, and finally returns to the resident site, so that the total distance or road cost is the smallest. (backtracking))
(系统自动生成,下载前可以参看下载内容)
下载文件列表
文件名 | 大小 | 更新时间 |
---|---|---|
经剪枝后的解空间树 截图.png | 37332 | 2017-06-12 |
旅行售货员问题(回溯法).cpp | 2527 | 2017-06-12 |