搜索资源列表
背包问题递归算法
- 背包问题的递归算法,以C语言原代码给出,有需要的朋友 可以下载,不许要帐号,自由下载。-knapsack problem recursive algorithm to the original C language code is given, a friend in need can be downloaded allowed to account, free download.
背包问题之贪婪算法求解C语言源代码)
- 背包问题的贪婪算法,需要的下,不需要帐号的,自由的下。-knapsack problem of greedy algorithm, need, need not account, free under.
背包问题祥解
- 背包问题详细解释,很简单,没有密码 直接解压-knapsack problem detailed explanation is quite simple and not directly extracting passwords
0-1背包问题
- 该程序用贪心算法来求解0-1背包问题 采用贪婪准则:每次选择p/w最大的物品放入背包。-procedures with the greedy algorithm to solve 0-1 knapsack problem using greed criteria : Each choice p / w largest goods Add backpack.
基于vc的背包问题的实现
- 这是计算机算法中的背包问题的实现程序,使用VC开发!-This is a realization of backbag problem with VC++
背包问题2 递归
- 一个0-1背包问题的C++实现,背包的容量为t,各物品的重量分别为w1,w2。。。wn,找一个能装下最大重量的物品组合,用递归形式的贪心法实现-a 0-1 knapsack problem of C achieved, the capacity for backpack t, the weight of the items were w1, w2. . . Wn, one can find the largest installed under the weight of goods portf
背包问题的动态规划法算法(c++)
- 数据结构 算法设计与分析背包问题的动态规划法算法-data structure design and analysis of algorithms knapsack problem of dynamic programming algorithm
c++实现0-1背包问题
- 用C++工具,使用动态规划算法实现0-1背包问题,(implementation of the 0-1 knapsack problem with C++)
背包问题测试数据
- 可以解决背包问题没有合理数据的程序()
背包问题动态规划详解
- 0/1背包问题动态规划详解及C代码 动态规划是用空间换时间的一种方法的抽象。(0/1 knapsack problem dynamic programming detailed and C code Dynamic programming is the abstraction of a method of replacing time with space.)
背包问题
- 算法效果较为良好,实现背包问题价值最大,采用遗传算法实现的比较不错的结果(The algorithm effect is good, the maximum value of the knapsack problem, genetic algorithm is used to achieve good results)
贪心算法背包问题
- 一个简单贪心算法的研究,背包问题,供大家浏览参考。(A simple greedy algorithm research, knapsack problem, reference for browsing.)
背包问题课程设计报告
- 已知n个物体的重量依次为W1>W2>W3>…….Wn,一个背包可以容纳物体的重量为W,将这些物体放入背包,要求所放置的物体的重量正好为W。(There are something,the number is n,the weight is w1>w2>w3>...wn,a bag can hold a weight of w,put these things into the bag,is just the weight.)
背包问题
- 贪心算法解决背包问题:给定n种物品和一个背包。物品i的重量是Wi,其价值为Vi,背包的容量为C。应如何选择装入背包的物品,使得装入背包中物品的总价值最大?(The greedy algorithm solves the knapsack problem: a given n item and a backpack. The weight of the item I is Wi, its value is Vi, and the capacity of the knapsack is C. How
贪心法求背包问题
- 贪心法求背包问题,如何选择使得背包中物品价值最大(A greedy method for the problem of knapsack)
回溯法求解0-1背包问题
- 文件包括回溯法求解0-1背包问题的C++源程序,包括运行界面(The file includes a backtracking method for the C++ source program for solving 0-1 knapsack problems, including the running interface)
PSO算法解决背包问题
- 粒子群算法与多目标优化问题的结合,解决背包问题实例(Combining particle swarm optimization with multi-objective optimization, we solve knapsack proble)
遗传算法01背包问题
- 使用遗传算法解决01背包问题,并输出得到最大价值的遗传代数以及每一代的最大价值(Using genetic algorithm to solve 01 knapsack problem)
matlab程序(解决0-1背包问题)
- 使用遗传算法解决0-1背包问题,调试成功,非常适合初学者了解遗传算法和0-1背包问题(Using genetic algorithm to solve 0-1 knapsack problem, debugging is successful. It is very suitable for beginners to understand genetic algorithm and 0-1 knapsack problem.)
NSGA2解决0-1背包问题
- 用遗传算法解决背包问题,供大家参考交流。。。(Using genetic algorithm to solve the knapsack problem, for your reference and exchange...)