搜索资源列表
zhaobeibaoshuzu
- 2.1寻找背包数组及遍历工具写法图文演示！ -2.1 Array and find backpack traverse graphic demonstration of writing instrument! 2.1 Array and find backpack traverse graphic demonstration of writing instrument!
01
- 这是我们大学里的课程设计，实现简单的0、 1背包问题，目的就是用最少的资源做做多的事情- This is our university course design, realization simple 0, 1 knapsack problem, the purpose is to use the minimal resource do more things
[itpub[1].net]ACM2000
- 解决背包问题，用各种方法解决各种问题，不断的加深对问题的熟悉程度-Solve the knapsack problem, a variety of ways to solve various problems continue to deepen familiarity
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.
ga01beibao
- 改进后的遗传算法采用自然数直接编码在个体选择上结合使用常用的最优个体保留策略和轮盘赌法，基于经典0-1背包问题的数学模型基础，构造改进后的遗传算法和适应度评估，减少二进制编码或浮点型编码的复杂性，同时精 简 适 应 度 评 估 的 计 算。-Improved genetic algorithm uses natural number encoded on individual choice combined with the use of commonly used best individua
package
- 改代码实现的是用贪心算法解决0—1背包问题，用c++实现。-Change the code is to solve 0-1 knapsack problem with the greedy algorithm, using c++ implementation.