搜索资源列表
0_1beibao
- 分别用回溯法和动态规划解决0-1背包问题，输出装入背包的顺序-Backtracking and dynamic programming to solve the 0-1 knapsack problem, the order in which the output is loaded backpack
knap-error
- 利用回溯法解决0-1背包问题，希望对于开始学习算法的同学有所帮助-Backtracking to solve 0-1 knapsack problem, I hope to help students start learning algorithm
huisu
- 0-1背包问题的回溯算法，算法分析与设计-0-1 knapsack problem backtracking algorithm, algorithm analysis and design
01dongtaiguihua
- 0-1背包问题的动态规划算法，算法分析与设计-0-1 knapsack problem dynamic programming algorithm, algorithm analysis and design
01tanxin
- 0-1背包问题的贪心算法，算法分析与设计-0-1 knapsack problem of the greedy algorithm, algorithm analysis and design
backpack
- 动态规划实现0-1背包问题和贪心法实现背包问题-Dynamic programming to realize knapsack problem and greedy method to realize knapsack problem
12-01bag
- 01背包问题 问题陈述：给定n种物品和一背包，物品i的重量是wi，其价值为vi，背包的容量为C。合理选择物品装入背包，使得装入背包中物品的总价值最大。在选择装入背包的物品时，对每种物品i只有两种选择，即装入背包或不装入背包。不能将物品i装入背包多次，也不能只装入部分的物品i。 问题分析：0 1背包问题是一个子集选取问题，适合于用子集树表示0 1背包问题的解空间。在搜索解空间树时，只要其左儿子结点是一个可行结点，搜索就进入左子树，在右子树中有可能包含最优解时才进入右子树搜索；否则将右子树
Knapsack
- 0-1背包问题 此算法包含了输入界面，可以随意设置货物的数量和价值。-0-1 knapsack problem algorithm includes the input interface, the number and value of the goods can be arbitrarily set.
jicha
- 解决1-1背包问题的最简便的解法可以有里面这一种提供出来-The easiest solution to solve the 1-1 knapsack problem can be inside this kind of out
beibao22
- 0.1背包问题有多种揭发，这应该是最简单的一种，很容易的写法-Variety expose of 0.1 knapsack problem, which should be the most simple, it is easy wording
stressen
- 解决1-1背包问题的最简便的解法可以有里面这一种提供出来-The easiest solution to solve the 1-1 knapsack problem can be inside this kind of out
SAPSO
- 0-1背包问题是学习算法时一个非常常用的简单问题，可以用多种智能优化算法实现，这里用到了蚁群算法和模拟退火算法还有两种方法的结合三种方法来实现。-0-1 knapsack problem is a simple learning algorithm is a very common problem, and can use a variety of intelligent optimization algorithm, ant colony algorithm and simulated ann
daima
- 动态规划，贪心算法和回溯解决0-1背包问题-Dynamic programming, greedy algorithms and backtracking to solve 0-1 knapsack problem
1
- C语言使用回溯法实现背包问题，控制台程序。-C language knapsack problem using backtracking
solution-of-knapsack-problem
- 回溯法、分支限界法的原理，并能够按其原理编程实现解决0-1背包问题，以加深对回溯法、分支限界法的理解。 -Backtracking, branch and bound method principle, and can according to the principle of programming to realize solving knapsack problem, in order to deepen our understanding of the backtracking, bra
ConsoleApplication1
- 0，1背包问题的C#代码实现，供学习算法使用-0,1 knapsack problem C# code to achieve for the use of the learning algorithm
0-1packets
- 一个算法的实现：使用分支界限法求解0-1背包问题-The realization of an algorithm: 0-1 knapsack problem using the branch and bound method
01-backpack
- ACM算法问题：0-1背包问题。此代码用vc++b编写。-ACM algorithm problem :0-1 of the knapsack problem. Write this code vc++b.
0-1bag
- 算法课程中的经典案例 0-1背包问题 采用动态规划思想解决-A classic case of the algorithm courses 0-1 knapsack problem using dynamic programming to solve
0-1beibaowenti
- 用C++编的关于0-1背包问题的源程序，程序可以运行-Source on the 0-1 knapsack problem compiled C++ used, the program can run