搜索资源列表
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
- 用c语言编写的背包问题的算法设计,属于控制台编程-Knapsack problem using the c language algorithm design, and a console programming
beibao
- 给定n种物品和一背包。物品i的重量是wi,其价值为vi,背包的容量为C。问应如何选择装入背包的物品,使得装入背包中物品的总价值最大?-Given the n kinds of goods and a backpack. The weight of the items i wi, the value of vi, the knapsack of capacity C Asked how to select the items of the loaded backpack, making the l
beibao
- 背包问题的解决,,实现在最大载重量下利润最大化的问题-The solution of the knapsack problem
beibao
- 背包问题是经典的数学问题,很多问题都可以转化为该问题而解决,希望该程序对你有所帮助。-Knapsack problem
beibao
- 背包问题,也就是我们常见的那个。在很多的专题实验中都会遇到-Knapsack problem, that is, our common one. Will encounter a lot of topics experiment
0-1-beibao-
- 0。1 背包问题,带有输入说明,和程序详细解释-0.1 knapsack problem, with input instructions, and procedures explained in detail
beibao
- 智能控制解决背包问题的文章,程序等,很实用!-Intelligent Control solve the knapsack problem article, the program is very useful!
beibao
- 背包问题,用PSO解背包a=[95 4 60 32 23 72 80 62 65 46] 物品的体积 c=[55 10 47 5 4 50 8 61 85 87] 物品的价值 b=269 背包的重量限制-Knapsack problem, PSO solutions backpack a = [95 4 60 32 23 72 80 62 65 46] the volume of goods c = 55 10 47 5 4 50 8 61 85 87] b = 269 valu
beibao
- 用简单的c语言实现简单的01背包程序源代码,方法比较简单。-Simple c language the the 01 backpack program source code, the method is relatively simple.
beibao
- 设有一个背包可以放入物品的重量为s,现有n件物品,重量分别为w[0],w[1],...,[n-1]。问题是能否从这n件物品中选择若干件放入此背包中使得放入的重量之和正好等于s。-Has a backpack can be placed in the weights of the articles of s, the existing n items, weight W [0], w [1], ..., [n-1]. The question is whether this certain wei
beibao
- 实验,背包问题贪心算法。使装入背包的物品的价值最大。-Experiments, the greedy algorithm knapsack problem.
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
beibao
- 解决算法中的数组问题,很详细很精确的解法,让你一看就明白-Solve an array of problems in the algorithm, very detailed and very accurate solution, let you see at a
beibao
- 给定一个容量为C的背包及n个重量为 wi,价值为pi的物品,要求把物品装入背 包,使背包的价值最大,此类问题为背 包问题。物品或者装入背包,或者不装 入背包,称之为0/1背包问题。 -A given a capacity for the the C of the backpack, and n a of by weight for the wi, the value of for the the the items of of pi, requirements of the
beibao
- 0-1背包问题,实现对一组货物价值最大化的筛选,应用排序和贪心算法实现。-0-1beibao problem
beibao
- 一个 数据结构 关于背包问题的求解 c语言源代码-A knapsack problem solving on c language source code
beibao
- 背包问题 C++ knapsack problem -The realization of the knapsack problem C++
beibao
- 背包问题并行算法MPI源程序 并行思想加快速度-Parallel algorithm knapsack problem thinking speed parallel MPI source
beibao
- 一个背包问题的启发式算法,在处理小数据时可以快速得到结果。-A heuristic algorithm for knapsack problem, in dealing with small data can quickly get results.