查看会员资料
用 户 名:露***
发送消息- Email:用户隐藏
- Icq/MSN:
- 电话号码:
- Homepage:
- 会员简介:
最新会员发布资源
oneTSP
- 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 th