搜索资源列表
Knap2
- knap2 背包问题非递归,运用栈及回溯算法优化了一下,可以找到所有满足条件的解。 如果遇到什么问题,请发邮件至horsewhite32@hotmail.com,笔者将不胜感激 uuhorse-non-recursive knap2 knapsack problem, the use of stack and the backtracking algorithm to optimize the look, you can f
BagZeroOne
- java语言实现动态规划求解0-1背包问题。-java dynamic programming language for solving 0-1 knapsack problem.
2
- 用回溯解背包问题 假设有n件物品,定义一个结构体a[]来存储,结构体有两个成员weight和value(weight表示重量,value表示价值)先定义一个数组col[]表示每个物品当前状态(为1表示被选,为0表示未被选),其初值全为1,从下标为0开始遍历,当前所选物品总重和总价值分别设为tw和tv(初值均为0),背包的限重设为limit,若第i个物品满足tw+a[i].weight<=limit且col[i]==1 就将a[i]
Knapsack_V6.0
- vc实现的0-1背包问题,一般递归方法,动态规划方法和贪心方法-vc achieved 0-1 knapsack problem, the general recursive method of dynamic programming methods and greedy method
0-1
- 0-1背包问题的贪心算法 希望对大家有帮助-0-1 knapsack problem the greedy algorithm would like to help everyone
beibao
- 通过贪心算法实现背包问题,可实现小规模背包问题-Through the greedy algorithm knapsack problem, enabling small-scale knapsack problem
EX04
- 遗传算法,用此算法可以得到很多计算背包问题的方法,可以和其他的算法进行比较。-Genetic algorithm, using this algorithm for calculating the backpack can be a lot of problems, and other algorithms can be compared.
01knapsackMFC
- 01背包问题演示程序 用mfc实现01背包问题的dp算法-01 knapsack problem with mfc demo program to achieve 01 knapsack problem algorithm dp
Knapsack
- 0-1背包问题, 0-1背包问题 Version 1.0 2008-10-28-0-1 knapsack problem, 0-1 knapsack problem Version 1.02008-10-28
c
- 用回溯法求解0—1背包问题,并输出问题的最优解。-Retrospective method with 0-1 knapsack problem, and output the optimal solution of the problem.
bag
- 分支限界法解决0/1背包问题,用c++的优先队列方法-Branch and bound method to solve 0/1 knapsack problem, using c++ Priority queue method
0-1-knapsack-problem
- 模拟退火解决0-1背包问题,初学者可以借鉴-Simulated annealing to solve 0-1 knapsack problem, beginners can learn from
d
- 1. 0-1背包问题 在0 / 1背包问题中,需对容量为c 的背包进行装载。从n 个物品中选取装入背包的物品,每件物品i 的重量为wi ,价值为pi 。对于可行的背包装载,背包中物品的总重量不能超过背包的容量,最佳装载是指所装入的物品价值最高 -1. 0-1 knapsack problem at 0/1 knapsack problem, there is a need for a capacity of c for the
i-ant
- 采用了基本的蚁群算法来求解0-1背包问题,该算法不仅可以对0-1背包问题进行求解,还可以对多维背包问题进行求解。-Using the basic ant colony algorithm to solve the 0-1 knapsack problem, the algorithm not only for the 0-1 knapsack problem can be solved, but also multi-dimension
Knapsacks
- 0/1背包,N皇后求解 0/1背包,N皇后求解
beibaoVC6
- VC6实现背包问题,内容详实,易懂,非常适合初学者-VC——beibao
ACO_0_1_bag
- 蚁群算法解0-1背包问题 内附测试文件 解的质量一般叫好,但是背包数增加时,耗时较长-Ant Colony Algorithm for 0-1 Knapsack Problem solution document containing test the quality of the general good, but the increase in the number of backpack, the longer time-
beibao
- 采用遗传算法解决0-1背包问题,即装入物体容量有限,每个物体有不同价值,使得最终价值最高-Using genetic algorithm to solve the 0-1 knapsack problem, that is, limited capacity into objects, each object has a different value, making the final value of the maximum
0-1beibao
- 0-1背包问题~实现完整程序~直接解压缩即可~-0-1 knapsack problem ~ ~ Direct to achieve a complete decompression procedures can be ~
01pack
- 用动态规划,贪心算法等算法实现01背包问题-Using dynamic programming, greedy algorithm knapsack problem algorithm 01