搜索资源列表
ACO
- 蚁群算法解决0-1背包问题,是一个比较小的程序,运行过,没有问题的。-the solving method of zero to one backage with ACO.It is a small programe for the zero to one problem.
Knapsack
- java实现0/1背包问题,算法中所用到的为动态规划寻找最优解的思想。-java to achieve 0/1 knapsack problem, algorithms are used to find the optimal solution for the dynamic programming ideas.
knapsack
- 这个文件夹包含了0-1背包问题的源代码、可执行文件和上级报告。-This folder contains the 0-1 knapsack problem source code, executable files, and supervisor.
knapsack
- MFC写的用动态规划法解决0-1背包问题。-solve 0-1 knapsack problem using dynamic programming.
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.
DynamicProgramming_01backpack
- 0-1背包问题是一个经典的算法问题,有多种解法,这里用动态规划的方法求解。-0-1 knapsack problem is a classical algorithm for the problem, there are a variety of solution, where the method for solving using dynamic programming.
bag_program
- 0-1背包问题,算法设计中最常见也是最经典的问题,希望对学习算法的有所帮助-0-1 knapsack problem, algorithm design of the most common and most classic problems in the hope of learning algorithms help
lhl.java
- 用JAVA语言 动态规划算法解决0/1背包问题-good
backpack-ga-algorithm
- 背包问题或0-1背包问题遗传算法程序,里面用的实数编码方式值得借鉴。-0-1 knapsack problem or knapsack problem genetic algorithm procedure, which uses real coding can be learned.
GA
- 遗传算法 0-1背包问题的代码 初始群体 选择 交叉 变异 评估函-0-1 knapsack problem genetic algorithm code for the initial assessment of functional group selection crossover and mutation
lingyibeibao
- 0/1背包问题的动态规划算法,要求输出背包内物品的最大价值以及选入背包的物品种类,利用动态规划方法设计背包问题-0/1 knapsack problem of dynamic programming algorithm, the maximum output value in the backpack items and selected by the backpack, dynamic programming method to design a knapsack problem
DP
- 算法设计的经典问题,动态规划算法,实现0-1背包问题-Classic problem of algorithm design, dynamic programming algorithm to achieve the 0-1 knapsack problem
language18-22casesofactual
- 实例18 实现基本的串操作 实例19 计算各点到源点的最短距离 实例20 储油问题 实例21 中奖彩球问题 实例22 0-1背包问题- Instance 18 Achieve the basic string operations Instance 19 Points to calculate the shortest distance from source Instance 20
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
knapsack
- 对于0—1背包问题问题利用动态规划法在C++中进行编程解决。-Knapsacks
Arithmetic
- 用JAVA完成的0-1背包算法,一共用了四种算法,包括贪心,分治,动态规划,回溯。把工程导入ECLIPSE下就可以了。-JAVA finished 0-1 with a knapsack algorithm, a share of the four algorithms, including greedy, divide and conquer, dynamic programming, backtracking. To work on it under into ECLIPSE.
knapsackproblem
- 贪心算法,回溯法,动态规划算法解决0-1背包问题-Greedy algorithms, backtracking, dynamic programming algorithm to solve 0-1 knapsack problem
01bag
- 0-1背包问题算法,采用动态规划思想实现。-the Algorithm of 0-1bag problem,it is implemented with Dynamic programming.
01pack
- 0-1背包问题:给定n种物品和一个背包。物品i的重量是Wi,其价值为Vi,背包的容量为C。应如何选择装入背包的物品,使得装入背包中物品的总价值最大?在选择装入背包的物品时,对每种物品i只有两种选择,即装入背包为1或不装入背包为0.不能将物品i装入背包多次,也不能只装入部分物品i。-0-1 pack
beibaowenti
- 一种介绍求解0-1背包问题的快速蚁群算法的PDF文档。-A descr iption for the 0-1 knapsack problem fast ant colony algorithm PDF documents.