搜索资源列表
01背包算法
- 一个简单的01背包算法，物品数量限制在10以内。-a simple 01 backpack algorithm, the number of items within the limit of 10.
01背包
- 01背包问题算法
01背包问题
- 01背包问题-动态规划 直接可用
01背包问题
- 采用分枝限界法解决0/1背包问题! 本人上机实习作业,通过老师验收,合格! 针对部分上机实习的同学可以来下~-used Branch and Bound France 0/1 knapsack problem! I practice on the machine operations, acceptance by the teachers, qualified! In view of the attachment on the
01背包算法
- 一个简单的01背包算法，物品数量限制在10以内。-a simple 01 backpack algorithm, the number of items within the limit of 10.
017387-01
- 论坛代码 用分支界限法解决的几个问题:包括0-1背包问题,最大团问题,电路布线问题,最大装载问题.作业最优处理问韪-Forum with the branch code boundaries to solve several problems : including 0-1 knapsack problem, the largest group, circuit wiring problem, the greatest problem
01
- 01背包问题的经典实现。在VC6下面调试通过。学习算法的朋友可以借鉴一下-01 to achieve the classic knapsack problem. VC6 debugger in the following through. Learning algorithm can learn from you friends
01knapsack
- 01背包问题的C++源程序，写的比较简单-01 knapsack problem C++ Source code, written in relatively simple
Solving.the.01.Knapsack.Problem.with.Genetic.Algor
- 遗传算法求解01背包问题＋实验报告＋参考文献。如果你看了这个程序还是不能明白遗传算法的巧妙，那么还是不要再看这个问题了。-Genetic Algorithm for Knapsack Problem 01 experimental report references. If you read this procedure should not understand the genetic algorithm or clever,
0-1Knapsack.problem
- Knapsack problemnew01背包问题（动态规划） 01背包实验报告-Knapsack problemnew01 knapsack problem (dynamic programming) 01 backpack Experimental Report
01beibao
- 这是一个用分支限界法实线01背包问题的说明文档，包含代码-This is a branch and bound method with solid line 01 knapsack problem of documentation, including code
01beibao
- 01背包问题，里面有四种算法，分别为动态规划，分支限定发，回溯法和谈新算法！-01 knapsack problem, there are four kinds of algorithms, dynamic programming, respectively, branch limit hair, the new algorithm backtracking peace!
01back
- 01背包问题算法源码，方便大家学习不同算法-01 knapsack problem algorithm source code, to facilitate them to learn from different algorithms
pack_of_four_algorithms
- 01背包四种算法实现:动态规划法,分支限定法,回溯法,贪心算法-01 pack of four algorithms: dynamic programming, branch limit method, backtracking, greedy algorithm
01
- c++利用回溯法来实现01背包问题 阶段是：在前N件物品中，选取若干件物品放入背包中； 状态是：在前N件物品中，选取若干件物品放入所剩空间为W的背包中的所能获得的最大价值； 决策是：第N件物品放或者不放； -c++ using backtracking to achieve the 01 knapsack problem Stage: the first N items, select the number of it
01
- 01背包问题，利用的是动态规划的思想，不是改进的01背包算法-01 knapsack problem, the use of dynamic programming is the idea, not the 01 knapsack algorithm to improve
test-data-for-01-knapscap-problem
- 这个是用于01背包问题的测试数据，很多论文都用这其中的数据集来测试-This is a knapsack problem for the 01 test data, a lot of papers with which the data set to test
粒子群01背包
- 用粒子群算法解决01背包问题（100个物品）从而得到最优解(The particle swarm algorithm is used to solve the 01 knapsack problem (100 items), and thus the optimal solution is obtained)
01beibao_fenzhijiexian
- 分治法实现01背包问题，输入为即将放入背包的物品的重量和对应价值的数组，输出为放置物品的最优方案(Realization of 01 knapsack problem by divide and conquer method)
遗传算法01背包问题
- 使用遗传算法解决01背包问题，并输出得到最大价值的遗传代数以及每一代的最大价值(Using genetic algorithm to solve 01 knapsack problem)