搜索资源列表
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.
0-1package
- 遗传算法求解0-1背包问题，包含问题的求解步骤。-Genetic Algorithm 0-1 knapsack problem, including steps to solve the problem.
0-1questionshiyan
- 关于0-1背包问题的动态演示程序，处于实验版-0-1 knapsack problem on the Dynamic Demonstration Program, an experimental version
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.
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
bag01
- 解决0-1背包问题 欢迎批评指正-0-1 knapsack problem solving welcome criticism correction
01BEIBAOdongtai
- 0-1背包问题的动态规划算法C语言实现.Windows系统下 Wintc环境编写-0-1 knapsack problem of the dynamic programming algorithm C language. Windows systems Wintc Central Habitat prepared
TSPTravelingsalesmanproblem
- 完全图哈密尔顿圈的遗传模拟退火算法matlab通用源程序拟退火算法解0－1背包问题MATLAB源代码 -complete graph Hamilton Circle genetic simulated annealing Matlab to be definitive source solution annealing 0 - a knapsack problem MATLAB source code
GenerationAl
- 用遗传算法解0/1背包问题，背包问题是著名的NP完备类困难问题，此处给出解法。-Genetic Algorithm for 0 / 1 knapsack problem, knapsack problem is a well-known class of NP-complete problems. Solution is here.
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 loading. Optimal operating han
OI
- 用多种算法解决0－1背包问题，包括回朔法，动态规划，贪心算法等-algorithm used to solve a variety of 0-1 knapsack problem, including the retrospective method, dynamic programming, greedy algorithm
huishu01beibao
- 回朔解决0-1背包,里面有VC++的代码,可供大家参考,如里有误的,请和我联系-retrospective resolve 0-1 knapsack containing a VC code, for your reference, if there are mistaken. and please contact me! !
packageone
- 背包算法和0-1背包算法,c++实现,希望对大家有帮助!-knapsack algorithm and 0-1 knapsack algorithm, c achieve, and I hope to be helpful!
fenzhidingjie beibao
- 分支定界的0/1背包问题-branch delimitation of the 0 / 1 knapsack problem
0-1bag
- 3，算法设计0-1背包，要求用整形-3, 0-1 knapsack algorithm design and required plastic surgery
saa
- 使用模拟退火算法解0－1背包问题MATLAB源代码-using simulated annealing Xie 0-1 knapsack problem MATLAB source code
greedy
- 使用贪婪算法 解决0－1背包问题MATLAB源代码-greedy algorithm used to solve 0-1 knapsack problem MATLAB source code