搜索资源列表
beibao
- 假设有一个能装入总体积为T的背包和n件体积分别为w1 , w2 , … , wn 的物品,能否从n件物品中挑选若干件恰好装满背包,即使w1 +w2 + … + wn=T,要求找出所有满足上述条件的解。例如:当T=10,各件物品的体积{1,8,4,3,5,2}时,可找到下列4组解: (1,4,3,2) (1,4,5) (8,2) (3,5,2)。 -Suppose there are a load of the backpack of the total volume of T
beibao
- 求解背包问题:一个背包可装总重量 T,现有 n 个物件,其重量分别为(W1、W2、…、Wn)。问能否从这 n 个物件中挑选若干个物件放入背包中,使其总重量正好为 T ?若有解则给出全部解,否则输出无解-Knapsack problem: a backpack can be fitted to the total weight of T n existing object, its weight (W1, W2, ..., Wn). Asked whether this n objects to
Minimum-backpack
- 假设有许多盒子,每个盒子能保存的总重量为1.0。有N个项i1,i2,…,iN,它们的重量分别是w1,w2,…,wN。 目的是用尽可能少的盒子放入所有的项,任何盒子的重量不能超过他的容量。-Suppose there are many box, each box can be saved on the total weight of 1.0. N items I1, I2, ..., IN, the weight of them are w1, w2, ..., Wn. The purpos