搜索资源列表
beibao
- 用java 实现 动态规划求0-1背包问题两个实例 包括改进后的算法实现-0-1 knapsack problem of the dynamic programming algorithm, 0-1 knapsack different from the knapsack problem
beibao
- 解决简单的背包问题,大学数据结构的实验内容-Solve simple knapsack problem, the University of the data structure of the experimental content
beibao
- 这是一个用C#编写的程序,主要是实现0-1背包问题。-this is a code written by C#.
01-beibao
- 动态规划求解01背包 vc6.0-dynamic programming 0/1 knapsack
beibao
- 帮助你学习c++,能跟好的理解c++语言的作用 -good code help you learn c++ program
DP_Beibao
- 这个是自己用matlab编写的简单的背包问题源程序-DP beibao
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
- 01背包中的实现 用五种不同的方法实现-The 01 backpack realization using five different methods to achieve
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
- 背包问题,从m个物品中选出某几个,在背包的承重范围内使得背包的价值的最大-Knapsack problem, a few selected from the m items, making the value of the backpack in the backpack load-bearing within
beibao
- 实验,背包问题贪心算法。使装入背包的物品的价值最大。-Experiments, the greedy algorithm knapsack problem.