搜索资源列表
ant
- 蚁群算法 目前在生活工作中越来越占很大比重 比如0-1规划，背包旅行等等都很方便运用。-Ant colony algorithm is currently living and working more and accounted for a large proportion, such as 0-1 programming, backpacking, and so is very convenient to use.
0_1beibao
- 0_1背包问题的分支定界法算法 希望帮到大家-0_1 branch and bound method for the knapsack problem algorithm
baf47cb43b3d0685
- 遗传算法解决背包问题 报告代码已经结果分析-Genetic algorithm to solve the knapsack problem
ga01beibao
- 改进后的遗传算法采用自然数直接编码在个体选择上结合使用常用的最优个体保留策略和轮盘赌法，基于经典0-1背包问题的数学模型基础，构造改进后的遗传算法和适应度评估，减少二进制编码或浮点型编码的复杂性，同时精 简 适 应 度 评 估 的 计 算。-Improved genetic algorithm uses natural number encoded on individual choice combined with the use of commonly used best individua
Knaspack-problems
- 背包问题，对于学习动态规划算法，有很大的帮助，系统的讲解背包问题。-Knaspack problems, It s helpful for you to study the algorithm of sotfware.
evolutionary-algorithm
- 二次背包问题的贪婪量子进化算法求解,对于初学者来说非常适用-Quadratic knapsack problem greed quantum evolutionary algorithm, is very suitable for beginners
Algorithm-design
- 算法设计中重点的几个函数算法，含有递归、堆栈、背包等-Several function algorithm algorithm design focus, containing recursion, stack, backpacks, etc.
package
- 改代码实现的是用贪心算法解决0—1背包问题，用c++实现。-Change the code is to solve 0-1 knapsack problem with the greedy algorithm, using c++ implementation.
pso_backpack
- 基于粒子群优化算法的求解背包问题的贪婪优化算法的matlab程序实现及测试文件-dsa dasd dvsdg savas
acm
- ACM入门算法之dp，背包，高级数据结构，搜索，图，最短路。(ACM Introductory algorithm)