搜索资源列表
knapsack
- MFC写的用动态规划法解决0-1背包问题。-solve 0-1 knapsack problem using dynamic programming.
KnapsackProblem
- 问题：已知有n种物品和一个可容纳M重量的背包，每种物品i的重量为wi。假定将物品i的一部分xi放入背包就会得到pixi的效益，这里，0≤xi≤1，pi>0。如果这些 物品重量的和大于M，要求所有选中要装入背包的物品总重 量不得超过M，而装入背包物品获得的总效益最大。-Question: are known to have n kinds of goods and M can hold the weight of a bac
knapsack
- 0/1 Knapsack Problem
Knapsack
- Knapsack problem. Fractional knapsack,DDG, 0-1 knapsack are included
BranchandBound_01backpack
- 0-1背包问题是一个经典的算法问题，有多种解法，这里用分支定界法求解。-0-1 knapsack problem is a classical algorithm for the problem, there are several solution here solved with branch and bound method.
multiplechoiceknapsack
- 关于多选择背包的很好的文章，提供了各种设计思路-Multiple Choice Knapsack Problem Example of planning choice in transportation
KnapSack
- Program for KnapSack problem
Knapsack
- Using java language implement an 0 / 1 knapsack problem. Using the recursive algorithm.And the interface also is added.
backpack-ga-algorithm
- 背包问题或0-1背包问题遗传算法程序，里面用的实数编码方式值得借鉴。-0-1 knapsack problem or knapsack problem genetic algorithm procedure, which uses real coding can be learned.
Knapsack
- Knapsack,用贪心算法解决背包问题，Visual C++ 6.0编译-Knapsack, with a greedy algorithm to solve knapsack problem, Visual C++ 6.0 compiler
GeneticAlgorithmsToSolveKnapsackProblem
- 用遗传算法解决背包问题，遗传算法的优势在于解决优化问题，对背包问题进行编码，然后随机产生使出样本，通过交叉，编译等操作来找到优化问题的解-Using genetic algorithms to solve knapsack problem, the advantage of genetic algorithms to solve optimization problem, knapsack problem is encoded, and
KnapSack
- Fractional knapsack problem, Greedy algorithm
beibaoPSO
- 这份源代码是用粒子群算法解决0/1背包问题，可以正常运行。-The source code is the particle swarm algorithm to solve 0/1 knapsack problem, it works.
Bag
- jcreator下写的背包问题，适合JAVA入门。给定背包的容量，在输入的物品中，求出符合条件的解，如果不存在解，则输出不存在-jcreator written under the knapsack problem, for JAVA entry. Given knapsack capacity, in input items, find qualified solution, if there is no solution, the
the_design_and_analysis_of_algorithm
- 算法设计与分析全部作业及实验资料. 第1章 最大覆盖问题 第2章 排列的字典序问题 第3章 depot仓库布局问题 第4章 priest繁忙的牧师 第5章 egypt埃及分数问题 第6章 squard方格移动问题 第7章 work工作安排问题 课堂算法 连续背包问题 课堂算法 作业调度问题 实验1 字典序问题 实验2 高精度乘法 实验3 0/1背包问题(DP) -Al
yichuansuanfa
- 将贪婪修复方法与遗传算法相结合，构成混和遗传算法，并求解经典背包问题。-The greedy repair method and genetic algorithm are combined to form hybrid genetic algorithm, and solve the classical knapsack problem.
knapsack
- knapsack 0/1 n fractional
knapsackAlgorithm
- 遗传算法实现背包问题的matlab代码，分享给大家-Knapsack problem genetic algorithm matlab code to share for everyone
Mixed-leapfrog-algorithm-to-solve-multi-knapsack-p
- 混合蛙跳算法解决多背包问题，此算法是在vs2005下编写，语法为基本的c语言（可以直接复制源码到vc中运行）-Mixed leapfrog algorithm to solve multi-knapsack problem, this algorithm is prepared in vs2005, the syntax for basic c language (can copy the source code to run vc)
Knapsack
- To implement knapsack cryptosystem-To implement knapsack cryptosystem....