文件名称:huoyun
-
所属分类:
- 标签属性:
- 上传时间:2012-11-16
-
文件大小:42.46kb
-
已下载:0次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
有几种货物,货物i的重量为W(i)价值为P(i).卡车的载重为C。问卡车依次装车如何选择货物最合算。
分别使用贪婪法和动态规划算法解决此问题。
-There are several cargo, goods, i, weight W (i) the value of P (i). Truck load of C. Q followed by loading a truck how to choose your best buy the goods. Respectively, using the greedy method and dynamic programming algorithm to solve this problem.
分别使用贪婪法和动态规划算法解决此问题。
-There are several cargo, goods, i, weight W (i) the value of P (i). Truck load of C. Q followed by loading a truck how to choose your best buy the goods. Respectively, using the greedy method and dynamic programming algorithm to solve this problem.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
算法设计实验三.doc
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.