搜索资源列表
glouton
- 以贪吃为基础算法解决背包问题，附加功能允许物品重量为0。在linux环境下用makefile进行编译。-to Dandelion-based algorithm to solve knapsack problem, additional feature allows weight to 0. Linux environment in the makefile used computer.
0_1question
- 计算机算法中著名的0_1背包问题：给定n种物品和一背包。物品i的重量是Wi，其价值为Vi，背包的容量是c，问应如何选择装入背包中的物品，使得装入背包中物品的总价值最大。-computer algorithm famous 0_1 knapsack problem : given n product and a backpack. I articles of the weight of Wi, the value of Vi and backpack is the capacity c, aske
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.
beibao__1wei
- 背包问题得模拟退火解法实现，调试通过，觉得有收藏价值。-knapsack problem in the simulated annealing method to achieve, through debugging feel the collectible value.
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
Fractionalbag
- 关于分数背包的解决 欢迎批评指教-scores knapsack on the settlement welcome comments and suggestions
OI
- 用多种算法解决0－1背包问题，包括回朔法，动态规划，贪心算法等-algorithm used to solve a variety of 0-1 knapsack problem, including the retrospective method, dynamic programming, greedy algorithm
package
- 详细介绍有多个背包的01背包问题，此问题是NP问题，不能用一般算法解决，此资料提供了一些分析，和一些近似算法-There are a number of details of the 01 backpack knapsack problem, this problem is NP problem, the general algorithm can not be resolved, this information provides some analysis, and some approxi
BeiBao1
- 动态规划算法求解0-1背包问题,动态规划算法knapsack求最优值-Dynamic programming algorithm for solving 0-1 knapsack problem, dynamic programming algorithm for optimal value knapsack
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-dimensional knapsack problem can be sol
OTHERS
- 包含一些大眾化的數學題目，比如說buffon丟針問題、dijkstra的三色旗問題、找零錢問題、背包問題、無限位數的整數運算、最短路徑問題-Contains a number of popular topics in mathematics, for example, lost buffon needle problem, dijkstra the tri-color flag in trouble, go to change the problem, knapsack problem, inf
beibaowenti
- 背包问题，如何装背包能使背包获得最大的价值-Knapsack problem, how to make backpack loaded backpack get the most value
Knapsack
- Knapsack problem. Fractional knapsack,DDG, 0-1 knapsack are included
Knapsack
- Using java language implement an 0 / 1 knapsack problem. Using the recursive algorithm.And the interface also is added.
KnapSack
- Fractional knapsack problem, Greedy algorithm
Knapsack
- Knapsack with dynamic programming
Knapsack-problem-based-on-GA
- 本文件含论文及源代码。论文首先介绍了基本遗传算法的基本原理、特点及其基本实现技术，接着针对背包问题，论述了遗传算法在编码表示和遗传算子（包括选择算子、交叉算子变异算子这三种算子）等方面的应用情况。并且结合背包问题实例，给出了具体的编码方法，运行参数，群体大小，最大迭代次数，以及合适的遗传算子。最后，简单说明了遗传算法在求解背包问题中的应用并对遗传算法解决背包问题的前景提出了展望。-The file containing the papers and source code. The paper
knapsack
- A branch and bound algorithm for the 0-1 knapsack problem.
lab7-knapsack
- the code for the knapsack problem