文件名称:huoyun
介绍说明－－下载内容均来自于网络，请自行研究使用
有几种货物，货物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