搜索资源列表
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 then resorted to randomly gen
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.
the_design_and_analysis_of_algorithm
- 算法设计与分析全部作业及实验资料. 第1章 最大覆盖问题 第2章 排列的字典序问题 第3章 depot仓库布局问题 第4章 priest繁忙的牧师 第5章 egypt埃及分数问题 第6章 squard方格移动问题 第7章 work工作安排问题 课堂算法 连续背包问题 课堂算法 作业调度问题 实验1 字典序问题 实验2 高精度乘法 实验3 0/1背包问题(DP) -Algorithm design and analysis of
yichuansuanfa
- 将贪婪修复方法与遗传算法相结合，构成混和遗传算法，并求解经典背包问题。-The greedy repair method and genetic algorithm are combined to form hybrid genetic algorithm, and solve the classical knapsack problem.
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)
bagPSO
- matlab 用PSO 解决背包问题-matlab solve the knapsack problem with PSO
0-1KnapsackProblem
- 這是一個使用greedy所寫的0-1 Knapsack Problem ，所有的物品若要取則必須全取，此程式可以讓背包裝最多且最有價值的物品-This is a greedy written using the 0-1 Knapsack Problem, to take all the items must all take, the program can back up and packing the most valuable items
backpack
- 对背包问题进行的求解，能够处理体积相同，但是不同物品的问题-The solution on the knapsack problem that can handle the same volume, but the problem of different items
knapsack
- C语言背包问题 Given n objects and a "knapsack." Item i weighs wi > 0 kilograms and has value vi > 0. ◦ Knapsack has capacity of W kilograms. ◦ Goal: fill knapsack so as to maximize total value.-C-Knapsack Problem Given n objects and
thegreedyalgorithmusinggeneticalgorithmssolveknaps
- 详细的讲述了贪心算法和遗传算法相结合去求解NP难题，背包问题。-Greedy algorithm described in detail and the combination of genetic algorithms to solve the NP problem, knapsack problem.
Knapsack
- 0/1背包问题，java差分进化算法实验-0/1 knapsack problem, java experimental differential evolution algorithm
0-1-back-pag-problem
- 背包问题 主要是应用了回溯的算法实现的 还用到了栈的思想-Knapsack problem is the application of backtracking algorithm are also thought to use a stack
knapsack
- 算法设计实验背包问题的实现visualc++实现。-Experimental realization algorithm knapsack problem