搜索资源列表
0-1
- 算法设计与分析:动态规划解决0-1背包问题
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.
背包问题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
0-1
- 0-1背包问题的贪心算法 希望对大家有帮助-0-1 knapsack problem the greedy algorithm would like to help everyone
GA
- 本程序是在MATLAB平台上,利用智能优化算法遗传算法来解决01背包问题。在0 / 1背包问题中,需对容量为c 的背包进行装载。从n 个物品中选取装入背包的物品,每件物品i 的重量为wi ,价值为pi 。对于可行的背包装载,背包中物品的总重量不能超过背包的容量,最佳装载是指所装入的物品价值最高。-This procedure is in the MATLAB platform using intelligent genetic algorithm optimization algorithm t
POS_c
- 本程序是用PSO用于求解NP难问题,如0-1背包问题,效果很好-This procedure is used PSO for solving the NP hard problems, such as 0-1 knapsack problem, well
knapsack
- 0-1背包问题,典型的动态规划问题的实现过程-0-1 knapsack problem, a typical dynamic programming problem of the realization of the process! ! !
0-1bag
- 实现0—1背包问题的分支限界搜索,为控制台应用程序,编译环境为vs2008-0-1 knapsack problem to achieve the branch and bound search for the console application, compile environment for vs2008
0-1beibao
- 0-1d背包问题实验报告 完整的程序 已经运行过的 -0-1d knapsack full lab report procedure has been run-off
0-1
- 我自己用C写的一个用分支界限法实现0-1背包问题,比较简便实用,而且易懂,比回溯法有明显的优势-I have written in C, a branch and bound method 0-1 knapsack problem is relatively simple and practical, and easy to understand, there are obvious advantages than backtracking
Backtracking-0-1
- 0-1背包问题的回溯法求解,0-1背包是在M件物品取出若干件放在空间为W的背包里,求出获得最大价值的方案。算法设计 回溯的思想。-Backtracking 0-1 knapsack problem solving 0-1 knapsack is removed in several pieces on items M space W backpack, determined to get the maximum value of the program. Backtracking algorit
0-1背包问题
- 0-1背包问题的实现,用HTML,js编写的算法(0-1 knapsack problem implementation, using HTML, JS algorithm written)
c++实现0-1背包问题
- 用C++工具,使用动态规划算法实现0-1背包问题,(implementation of the 0-1 knapsack problem with C++)
KnapSack2
- 0/1背包问题 利用的子集树,进行穷举算法实现(0/1 knapsack exhaustive problem)
背包问题动态规划详解
- 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.)
动态规划求解0-1背包问题
- 通过动态规划的算法得到装进背包的最大价值(The maximum value of knapsack is obtained by dynamic programming algorithm.)
0-1
- 利用动态规划实现0-1背包问题,文件包含源代码,解释说明及测试样例(Dynamic programming to achieve 0-1 knapsack problem.)
回溯法求解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)
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...)