搜索资源列表
0-1背包问题
- 动态规划法解决0-1背包问题
使用模拟退火算法（SAA）解决0－1背包问题
- 使用模拟退火算法（SAA）解决0－1背包问题-using simulated annealing (SAA) 0-1 knapsack problem solving
0-1背包
- 0-1背包问题算法在java语言的实现程序-0-1 knapsack problem algorithm java language in the realization process
0-1背包的回溯算法
- 回溯法解决0-1背包问题-Backtracking 0-1 knapsack problem solving
0-1背包的动态规划算法
- 动态规划0-1背包问题-Dynamic Programming 0-1 knapsack problem
0-1背问题
- 0-1背包问题 可以提供在背包方面遇到问题的学生或者有需要的人.-0-1 knapsack problem can provide a backpack problems encountered students or those who are in need.
上大_net-0-1背包问题(回朔法)
- 0 / 1背包问题是一个N P-复杂问题，为了解决该问题，，将用回溯算法解决该问题。既然想选择一个对象的子集，将它们装入背包，以便获得的收益最大，则解空间应组织成子集树的形状（如图1 6 - 2所示）。该回溯算法与4 . 2节的装载问题很类似。首先形成一个递归算法，去找到可获得的最大收益。然后，对该算法加以改进，形成代码。改进后的代码可找到获得最大收益时包含在背包中的对象的集合。-0/1 knapsack problem is a P-
贪婪算法解决背包
- 运用贪婪算法能够很好解决0/1背包问题，这是我编的一个小程序，运行过很好。-greedy algorithm can be used to solve a very good 0/1 knapsack problem, this is my part of a small program running very good.
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.
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!
0-1
- 0-1背包问题的贪心算法 希望对大家有帮助-0-1 knapsack problem the greedy algorithm would like to help everyone
0-1bag
- 实现0—1背包问题的分支限界搜索，为控制台应用程序，编译环境为vs2008-0-1 knapsack problem to achieve the branch and bound search for the console application, compile environment for vs2008
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.)
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)
应用禁忌搜索算法解决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.)