搜索资源列表
贪心方法
- 贪心方法解0/1背包问题,构造一个物品类,调用类方法对背包进行排序,核心代码已给出-greedy method for 0 / 1 knapsack problem, a structural categories of goods, the category called right backpack method for sequencing, the core code has been given
0-1bag
- 给定Ｎ种物体和一个背包．解决应如何选择装入背包的物品，使的装入背包的物品价值最大．-given N types of objects and a backpack. Address how to choose the items loaded backpack, the backpack loaded greatest value of goods.
01bag
- 经常遇到01背包的问题我在这里向大家提供该算法实现的具体过程-01 backpack often encountered the problem I am here to provide you with the algorithm to achieve the specific process
bag
- 这个小程序是算法设计与分析方面的,求解背包问题,用的是递归设用的方法,本程序不是本人做的,朋友做的,可以拿来参考一下,不要抄袭,本人尊重版权朋友.-this is a small program algorithm design and analysis, problem solving backpack, it was established with the recursive method, the procedure is not my doing, friends do, can be
beibao
- 非递归背包 而提尔而喝酒伊特和人家一块和金额很容易空间-Tire, but non-recursive backpack and a drink Voight and others, and the amount of space is easy to
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
Blood--information
- 热血/江湖背包。人物。怪物。信息遍历.-Blood/lakes backpack. Figure. Monster. Information traversal
main
- 采用多目标粒子群算法求解多目标背包问题 问题：假设存在五类物品，每类物品又包含四种具体物品，要求从五类物品中分别选择一种放入背包，使得背包总价值最大，总体积最小，总质量不超过92kg(The problem is solved by multi objective particle swarm optimization algorithm, multi-objective knapsack problem: suppose there are five categories of goods,