搜索资源列表
greedy
- 贪心法解决背包问题 可自己设置物品数量和背包总容量-Greedy method to solve the knapsack problem and the number of items can set up their own backpack with a total capacity
DP
- 动态分配法解决背包问题，自己设置物品总数,背包总容量-Dynamic allocation method to solve the knapsack problem, the total number of items set up their own backpack with a total capacity
0-1bag
- 经典的0-1背包问题，程序可以自动输入并且有注释-Classical 0-1 knapsack problem, the program can automatically entered and annotated
backpack-problem
- 描述《算法引论》上最基本的背包问题，PPT以及算法源码的实现-The most basic descr iption of the knapsack problem, " Introduction to Algorithms" on, PPT and algorithm realization source
ACA-doc
- parallel programing knapsack, parralel computing , k nearest neighbour, parallelizing MCMDKP.
KnacksackProblem_GA
- 应用遗传算法解决背包问题，采用二重结构编码，匹配映射交叉策略，倒位的变异策略.最终得到比较满意的结果。-Application of genetic algorithms to solve knapsack problem, the use of dual-structure code, cross-matching strategy mapping, inversion mutation strategy
DaA-of-Algo-cp
- 算法设计与分析经典问题：背包问题、数字三角问题等！-Design and Analysis of Algorithms classic problems: knapsack problem, digital triangle problems!
package
- 0-1背包问题，很简单的动态规划，没什么难的-0-1 knapsack problem, a very simple dynamic programming, is not that hard
GQA_backpak
- 解决背包问题遗传量子算法matlab实例-Quantum genetic algorithm to solve knapsack problem matlab examples
Package_ClassicProblem
- LINGO程序实现背包问题（Package）-LINGO program knapsack problem (Package)
Dong_tai
- 动态规划经典习题，算法导论例题实现，自己实现，有钢管划分问题，背包问题-Classical dynamic programming exercises, Introduction to Algorithms examples realize that he realized there steel partitioning problem, knapsack problem
0-1-bugs-question
- 0-1背包的几种算法的C++实现，包括分支限界、回溯法、贪心算法几种算法-Several 0-1 knapsack algorithm c++ implementation, including branch limit, backtracking algorithm and greedy algorithm
Genetic-Algorithm-
- 用遗传算法解决0_1背包问题，比较经典,适合做参考论文-0_1 knapsack problem solving using genetic algorithms, more classic, suitable reference paper
targetalloc
- 目标分配的遗传算法在matlab的实现，可以用于在武器分配，以及背包问题。-Target allocation matlab genetic algorithm implementations that can be used in weapons distribution, and the knapsack problem.
Knapsack_problem
- 动态规划算法实现的一类背包问题，经典的动态规划算法实例-A class of dynamic programming algorithm knapsack problem, the classic examples of the dynamic programming algorithm
Knapsack_problem2
- 动态规划算法实现的另一类背包问题// 背包问题 6个物体，重量为：5， 2， 1.7， 3.5， 1， 5.1 背包最大10，,追求装下的最大重量-Another knapsack problem dynamic programming algorithm to achieve// knapsack problem six objects, weight: 5, 2, 1.7, 3.5, 1, 5.1 backpacks maximum 10, the pursuit of maximum we
Knapsack_problem3
- 动态规划算法实现的背包问题：// 背包问题，容量m，n种货物，分别重量W1,W2......Wn，利润分别P1,P2......Pn，求最大利润 -Knapsack problem dynamic programming algorithm:// knapsack problem, the capacity of M, N type of cargo weight, respectively W1, W2... Wn, profits were P1, P2... Pn, maximum p
bag
- 背包问题求解的简单源码： 大学计算机算法实验-Knapsack Problem Source: University computer algorithm experiment
algorithm
- 1、Bellman-FordJ解决单源最短路径问题 c++实现 2、所有点之间最短路径问题 3、8皇后问题回溯法 4、0-1背包问题 回溯法 -Bellman-Ford algorithm All-pairs shortest path (choose one from the three algorithms) 8-queen problem (back backing) 0-1 knapsack problem (back tracking)
01beibao
- 0-1背包问题，空间点对问题，图形压缩，线性时间选择以及最优二叉树的java脚本程序-0-1 knapsack problem, the point of the problem space, image compression, linear time optimal tree selection and java scr ipt program