搜索资源列表
my0-1knapsack
- 给定n 个物品, 物品i重为wi 并且价值为 vi ,背包所能承载的最大容量为 W. 0-1 背包问题即是选择含有着最大总价值的物品的子集且它的容量 ≤W . 用动态规划实现-given n goods, items i weight of wi and value of vi, the backpack can carry a maximum capacity of W. 0-1 knapsack problem that is a choice with a maximum tot
背包问题的遗传算法解法vb
- 这是一用VB解决背包问题的遗传算法元程序,程序框架清楚,应用性强-This a backpack with VB solve problems of genetic algorithm yuan procedure is a clear framework and application-
01背包算法
- 一个简单的01背包算法,物品数量限制在10以内。-a simple 01 backpack algorithm, the number of items within the limit of 10.
背包问题程序
- 在0 / 1背包问题中,需对容量为c 的背包进行装载。从n 个物品中选取装入背包的物品,每件物品i 的重量为wi ,价值为pi 。对于可行的背包装载,背包中物品的总重量不能超过背包的容量,最佳装载是指所装入的物品价值最高,即Σpi*xi 取得最大值。-0 / 1 knapsack problem, the need for the capacity of the c loaded backpack. N items from the selected load backpack items, e
beibaowenti
- 一个实现背包的简单源程序.自己编的,有点简单,提供给初学者参考.-achieve a simple backpack source. His series, a little simple, for advanced users.
mathmodel2
- 1.1 背包问题 有一个徒步旅行者,已知他能承受的旅行背包的重量不超过a(kg)。设有n种物品可供他选择装入背包,这n种物品分别编号为1,2,…,n。其中第i种物品每件的重量为ai(kg),其使用价值(指一件第i种物品对旅行者来说所带来的好处的一种数量指标)为ci(i=1,2,…,n)。问这位旅行者应如何选择携带这n种物品的件数,使得总价值最大? -1.1 knapsack problem is a hikers. he is known to travel to withstand t
beibaowenti007
- 用动态规划的向后处理法求解背包问题的最优决策序列。即给定一个背包序列的重量和相对应的效益值。做出一个最优决策序列Xi(i=1~n),使得最终效益和最大。-dynamic planning backward processing method knapsack problem of optimal decision-making sequence. That is, given a sequence of backpack weight and the relative value of the
01knap
- 设有n种物品,每一种物品数量无限。第i种物品每件重量为wi公斤,每件价值ci元。现有一只可装载重量为W公斤的背包,求各种物品应各取多少件放入背包,使背包中物品的价值最高。-with n product, every kind of infinite number of copies. I first product for each weight wi kilograms, each worth ci yuan. Existing a carrying weight of the backpac
GAbag
- 遗传算法背包问题的论文电子图书。不错,试试吧。-GA backpack topics electronic library. Yes, try it.
PackageProblem
- 实现背包问题 package problem 1. 问题描述 假设有一个能装入总体积为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)。 2. 基本要求 读入T、n、w1 , w2 , … , wn
0_1question
- 计算机算法中著名的0_1背包问题:给定n种物品和一背包。物品i的重量是Wi,其价值为Vi,背包的容量是c,问应如何选择装入背包中的物品,使得装入背包中物品的总价值最大。-computer algorithm famous 0_1 knapsack problem : given n product and a backpack. I articles of the weight of Wi, the value of Vi and backpack is the capacity c, aske
monituihuo_beibao
- 模拟退火算法解决背包问题,使得背包能得到最好的利用。-Simulated annealing algorithm to solve knapsack problem, the backpack can be the best possible use.
backpack
- 已知N种物品和一个容纳重量为M的背包,每种物品均有自己的重量和效益值,假设这N种物品的重量和有可能大于M,这种情况下,选择哪种物品装入背包能获得最大效益值-Are known to have n kinds of goods and a weight capacity of M, backpacks, each item has its own weight and efficiency values, assume that n kinds of goods may be greater th
backpack
- 最基础背包算法的实现,简单明了,适合初学者看下,有帮助的-The most basic backpack algorithm implementation is simple, suitable for beginners to look helpful
Score-backpack
- 分数背包的实现,在基础背包的前提下,增加分数属性,实现背包问题-The realization of the score backpack to increase the score property, under the premise of basic backpack, knapsack problem
Backpack-Genetic-Algorithm
- Backpack Genetic Algorithm for knapsack problem
Backpack-Genetic-Algorithm-Beta-Version
- Backpack Genetic Algorithm Beta Version
Backpack-Genetic-Algorithm-
- Backpack Genetic Algorithm
0-1-backpack
- 本代码提供0-1背包问题的动态规划解法,适用于背包容量是整数类型-The code provides 0-1 knapsack problem dynamic programming solution for the backpack capacity is an integer type
problem-Backpack
- Resolution of the problem backpack