文件名称:0-1bag
介绍说明－－下载内容均来自于网络，请自行研究使用
假设有n件物品，每件物品有各自的重量W1,W2,……,Wn和
与之对应的价值V1,V2,……,Vn。设背包的容量为c，在不超过背包容量的前提下，求出获得最大价值总和的方案。（0-1背包的情况下物品不可分割，只能选择放入，或者不放入背包中）。
-Suppose there are n items, each item has its own weight W1, W2, ......, Wn and the corresponding value of V1, V2, ......, Vn. Let knapsack capacity is c, under the premise of not exceeding the capacity of the backpack, find solutions to maximize the total value. (0-1 backpack case of indivisible goods, can only choose placed or not placed in a backpack).
与之对应的价值V1,V2,……,Vn。设背包的容量为c，在不超过背包容量的前提下，求出获得最大价值总和的方案。（0-1背包的情况下物品不可分割，只能选择放入，或者不放入背包中）。
-Suppose there are n items, each item has its own weight W1, W2, ......, Wn and the corresponding value of V1, V2, ......, Vn. Let knapsack capacity is c, under the premise of not exceeding the capacity of the backpack, find solutions to maximize the total value. (0-1 backpack case of indivisible goods, can only choose placed or not placed in a backpack).
(系统自动生成,下载前可以参看下载内容)
下载文件列表
0-1背包实验报告.docx