搜索资源列表
0-1背包问题
- 动态规划法解决0-1背包问题
使用模拟退火算法（SAA）解决0－1背包问题
- 使用模拟退火算法（SAA）解决0－1背包问题-using simulated annealing (SAA) 0-1 knapsack problem solving
0-1背包的回溯算法
- 回溯法解决0-1背包问题-Backtracking 0-1 knapsack problem solving
0-1背包的动态规划算法
- 动态规划0-1背包问题-Dynamic Programming 0-1 knapsack problem
背包问题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 u
上大_net-0-1背包问题(回朔法)
- 0 / 1背包问题是一个N P-复杂问题，为了解决该问题，，将用回溯算法解决该问题。既然想选择一个对象的子集，将它们装入背包，以便获得的收益最大，则解空间应组织成子集树的形状（如图1 6 - 2所示）。该回溯算法与4 . 2节的装载问题很类似。首先形成一个递归算法，去找到可获得的最大收益。然后，对该算法加以改进，形成代码。改进后的代码可找到获得最大收益时包含在背包中的对象的集合。-0/1 knapsack problem is a P-
背包算法
- 高级算法中的背包问题求解，算法简便高效，主要解决动态规划0-1背包问题-senior algorithm to solve the knapsack problem, the algorithm is simple and efficient, dynamic programming solution 0-1 knapsack problem
背包问题祥解
- 背包问题详细解释，很简单，没有密码 直接解压-knapsack problem detailed explanation is quite simple and not directly extracting passwords
背包问题程序
- 在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 sel
0-1wenti
- 该程序是一个用动态规划法解决0-1背包问题的小程序，可以为学习动态规划法遇到困难的同学提供帮助-the program is a dynamic programming solution 0-1 knapsack problem of small procedures, to study the dynamic programming method difficulties encountered by students for hel
0-1beibao
- 0-1背包问题,采用了求最优解和求最优值,分别用递归和回代来实现.-0-1 knapsack problem using the optimal solution for the optimal value and demand, and to use recursive generation to achieve.
bag01
- 解决0-1背包问题 欢迎批评指正-0-1 knapsack problem solving welcome criticism correction
OI
- 用多种算法解决0－1背包问题，包括回朔法，动态规划，贪心算法等-algorithm used to solve a variety of 0-1 knapsack problem, including the retrospective method, dynamic programming, greedy algorithm
0-1
- 这是一个用C++实现的0/1背包问题，它是用贪心法实现的。-This is a C++ Achieved 0/1 knapsack problem, which is achieved using greedy method.
beibao
- 用回溯法求解0-1背包问题 用vc++实现 包含完整源代码 经过测试成功！-Retrospective method with 0-1 knapsack problem with vc++ Achieve that contains a complete source code has been tested successfully!
bags
- 四种算法（动态规划、回溯法、分支限界法、贪心法）实现0-1背包问题-four algorithms including dynamic planningm,tracing,branch and bound method and greedy to implement 0-1 bag problem.
c++实现0-1背包问题
- 用C++工具，使用动态规划算法实现0-1背包问题,(implementation of the 0-1 knapsack problem with C++)
回溯法求解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)
应用禁忌搜索算法解决0-1背包问题
- 利用禁忌搜索算法求解0-1背包问题。禁忌搜索算法相比其他搜索算法更优，设置藐视规则来避免陷入局部最优解。(Solve 0-1 Knapsack Problem based on Tabu search. The tabu search algorithm is superior to other search algorithms and sets contempt rules to avoid falling into local o
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.)