文件名称:Cpp1
介绍说明--下载内容均来自于网络,请自行研究使用
编写背包问题的动态规划求解代码。
背包问题 ,背包容量为W,物品个数为n,随机产生n个物品的体积(物品的体积不可大于W)与价值,求解该实例的最优解。
-Write knapsack problem dynamic Solver code. Knapsack problem, knapsack capacity of W, the number of items is n, randomly generated volume of n items (bulky items can not be greater than W) and the value of the optimal solution to solve this instance.
背包问题 ,背包容量为W,物品个数为n,随机产生n个物品的体积(物品的体积不可大于W)与价值,求解该实例的最优解。
-Write knapsack problem dynamic Solver code. Knapsack problem, knapsack capacity of W, the number of items is n, randomly generated volume of n items (bulky items can not be greater than W) and the value of the optimal solution to solve this instance.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Cpp1.cpp