搜索资源列表
ce_knapsack
- Solving knapsack with MATLAB
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
- 用C#来实现遗传算法中的背包问题。其中只有变异过程。-Using C# to implement the genetic algorithm knapsack problem. Only mutation process.
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
Greedy.algorithm.knapsack.application
- 贪心算法在背包中的应用Greedy algorithm for knapsack application -Greedy algorithm for knapsack application
thegreedyalgorithmusinggeneticalgorithmssolveknaps
- 详细的讲述了贪心算法和遗传算法相结合去求解NP难题，背包问题。-Greedy algorithm described in detail and the combination of genetic algorithms to solve the NP problem, knapsack problem.
knapsack-code-with-java
- knapsack with java scr ipt
knapsack
- 学习文档，是背包问题的，分享一下，希望对大家有用-Study documents, the problem is the knapsack, and share, we hope to be useful
Knapsack
- 0/1背包问题，java差分进化算法实验-0/1 knapsack problem, java experimental differential evolution algorithm
moga
- Genetic Algorithm for multi objective knapsack problem
Knapsack-problem
- 背包问题 言简意赅 易懂易学 一学就会-Knapsack problem concisely and a school will learn to understand
knapsack
- knapsack algorithm file-knapsack algorithm file
Knapsack-problem
- 背包问题，用遗传算法解决，并在VC++环境下调试通过，得到正确结果，可供参考，源码C文件中有较详细的注释-Knapsack problem, using genetic algorithm, and in the VC++ debugging environment through, get the correct results, for reference, source C files in more detailed comments
knapsack
- 算法设计实验背包问题的实现visualc++实现。-Experimental realization algorithm knapsack problem
01-knapsack-problem--
- 01背包问题的优先队列式分支限界算法程序实现-01 knapsack problem with priority queues to achieve branch and bound algorithm program
Knapsack-problem
- 背包问题(Knapsack problem)是一种组合优化的NP完全问题。问题可以描述为：给定一组物品，每种物品都有自己的重量和价格，在限定的总重量内，我们如何选择，才能使得物品的总价格最高。用2种方法实现背包问题，用C语言编写，数据结构课内试验-Knapsack problem (Knapsack problem) is NP-complete combinatorial optimization problem. Problem can be described as: Given a se
ipack
- vc++ 算法解决背包问题 贪心算法 algorithm to solve knapsack problem greedy algorithm-vc++ algorithm to solve knapsack problem greedy algorithm
Knapsack
- Knapsack with dynamic programming