搜索资源列表
0-1beibao
- 解决背包的取舍问题,问选择多少个不超过背包的重量的物品.能使价值最大.-solve knapsack choice question about the choice of the number does not exceed the weight of the backpack items. Make the greatest value.
0-1beibao
- 0-1背包问题的动态规划求解算法, 0-1背包不同于背包问题-0-1 knapsack problem of the dynamic programming algorithm, 0-1 knapsack different from the knapsack problem
c++huisu
- 背包回溯法,初来乍到如有其他问题还请各位多多指教.-knapsack backtracking, just arrived at that if other issues also invited to the exhibitions.
0-1snap
- 算法设计与分析 第五章王晓东版的 回溯法的0-1背包问题 -algorithm design and analysis of the fifth edition of Wang Xiaodong Zhang law retroactively 0-1 knapsack problem
01beibao
- 0-1背包问题,用动态规划算法来实现的.-0-1 knapsack problem with dynamic programming algorithm to achieve.
Tanxinfa1
- 0-1背包问题,按价值最大为标准时划分的.-0-1 knapsack problem, the maximum value of the standards.
beibaotanxinsuanfa
- 贪心算法,使用这一算法,解决0-1背包问题.-greedy algorithm, the algorithm used to solve 0-1 knapsack problem.
beibao__1wei
- 背包问题得模拟退火解法实现,调试通过,觉得有收藏价值。-knapsack problem in the simulated annealing method to achieve, through debugging feel the collectible value.
optimizebackpack
- 背包问题c算法实现,利用回溯法实现的背包问题详解,内附源代码即详细注解,以及一些优化的思想,很容易理解,是一个很好的算法,通过调试,可以运行。-knapsack problem c algorithm, using the retrospective method to achieve Hi knapsack problem, the source code that contains detailed notes, and some optimization thinking, it is e
0-1package
- 遗传算法求解0-1背包问题,包含问题的求解步骤。-Genetic Algorithm 0-1 knapsack problem, including steps to solve the problem.
Knapsack21
- 背包问题(java)一个用JAVA 实现的背包问题,P,W,M自己输入-knapsack problem (java) JAVA with a backpack, P, W, M own input
stree
- 装载问题,解决了在固定重量和分类的情况下最优装载,类似背包问题-loading problems, the fixed weight and classification of optimal loading, similar knapsack problem
beibaowentichengxu
- 一个关于算法分析的背包问题小程序 -an algorithm analysis on the small knapsack problem procedures.
0-1questionshiyan
- 关于0-1背包问题的动态演示程序,处于实验版-0-1 knapsack problem on the Dynamic Demonstration Program, an experimental version
DynamicKnap
- 动态规划背包问题,对算法初学者有极大的参考价值!-dynamic programming knapsack problem, the algorithm beginners have great reference value!
KnapsackProblem
- 这是典型的背包问题的测试集,可以在在程序编辑的时候使用这个来进行测试-This is a typical knapsack problem in the test set, in the process of editing to the use of the test
huisu
- 回溯(b a c k t r a c k i n g)是一种系统地搜索问题解答的方法。为了实现回溯,首先需要为问题定义一个解空间( solution space),这个空间必须至少包含问题的一个解(可能是最优的)。在迷宫老鼠问题中,我们可以定义一个包含从入口到出口的所有路径的解空间;在具有n 个对象的0 / 1背包问题中(见1 . 4节和2 . 2节),解空间的一个合理选择是2n 个长度为n 的0 / 1向量的集合,这个集合表示了将0或1分配给x的所有可能方法。当n= 3时,解空间为{ ( 0
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.
SJJG_BIT
- 常用数据结构演示:1、链表管理;2、二叉树;3、背包问题;4、力的实现;5、表达式计算;6、分水问题。-commonly used data structures exercise : 1, Chain management; 2, the binary tree; 3, knapsack problem; 4, the force achieved; 5. formulas; 6, the dividing issues.
0-1huisu
- 0-1背包回溯 0-1背包回溯 0-1背包回溯 0-1背包回溯 0-1背包回溯 -0-1 knapsack Retrospective 0-1 knapsack retrospective 0-1 knapsack retrospective 0 -1 knapsack retrospective knapsack retrospective 0-1 knapsack retrospective knapsack retrospective 0-1 knapsack retroactive to