搜索资源列表
使用模拟退火算法(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背包问题 采用贪婪准则:每次选择p/w最大的物品放入背包。-procedures with the greedy algorithm to solve 0-1 knapsack problem using greed criteria : Each choice p / w largest goods Add backpack.
上大_net-0-1背包问题(回朔法)
- 0 / 1背包问题是一个N P-复杂问题,为了解决该问题,,将用回溯算法解决该问题。既然想选择一个对象的子集,将它们装入背包,以便获得的收益最大,则解空间应组织成子集树的形状(如图1 6 - 2所示)。该回溯算法与4 . 2节的装载问题很类似。首先形成一个递归算法,去找到可获得的最大收益。然后,对该算法加以改进,形成代码。改进后的代码可找到获得最大收益时包含在背包中的对象的集合。-0 / 1 knapsack problem is a P-complex issues, in order to
0-1背包问题
- 动态规划法解决0-1背包问题
knapsack.rar
- 用GAlib库实现的解决0/1背包问题的遗传算法程序源代码。, Solution 0/1 knapsack question heredity algorithm procedure source code realizes which with the GAlib storehouse.
解决0-1背包问题
- 解决0-1背包问题,是算法设计与分析5.6节内容-Solve the 0-1 knapsack problem
fenzhixianjie
- 0/1背包问题的优先队列式分支限界算法程序-0/1 knapsack problem the priority queue-type branch and bound algorithm procedure
beibaobeibao
- 这是一个0/1背包问题的解决,有图形界面,是一次软件实习作业 -This is a 0/1 knapsack problem solving, graphics interface, the software is a practical operation
0-1
- 0-1背包问题的贪心算法 希望对大家有帮助-0-1 knapsack problem the greedy algorithm would like to help everyone
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背包
- 这是一个用C++写的简单0-1背包,可供初学者学习使用(This is a simple 0-1 backpack written in c ++ that can be used by beginners)
动态规划求解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)
应用禁忌搜索算法解决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 optimal solutions.)
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.)