搜索资源列表
背包问题用lc分支限界方法
- 01背包问题，用lc分支限界方法，做的ppt-01 knapsack problem, using lc branch and bound method, do ppt
bag
- 本程序是用c++实现的背包问题。相信会对大家有用的-This procedure is used c++ Realized knapsack problem. We believe it will be useful
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!
bagproblem
- 背包问题详细讲述，解释背包问题,喜欢的下载-Knapsack problem described in detail to explain the knapsack problem, like the download
S08070028assgin05
- 背包问题解法，也就是背包问题的求解，不是全解，仅一种-Knapsack Problem Solution
beibaosuanfa
- 给定n种物品和一个背包。物品i的重量是wi，体积是bi，其价值为vi，背包的容量为c，容积为d。问应如何选择装入背包中的物品，使得装入背包中物品的总价值最大？-Ideological core algorithm knapsack problem
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
A.doc
- 此代码为java版数据结构课程设计，求解背包为题数据结构,带界面,很全很详细.-This code for the java version of the data structures course design, the knapsack to the theme of the data structure with the interface, it is all very detailed.
[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.
backpack
- 背包问题,解决多少重量至少需要多少包的问题；-how to do about backpack,this question is very smart.
0_1beibao
- 0_1背包问题的分支定界法算法 希望帮到大家-0_1 branch and bound method for the knapsack problem algorithm
bagscankao
- 这个是有栈的背包问题参考，大家看看有什么意见可以留言-This is the stack knapsack problem reference, take a look at what advice can message
bagwithnotzhan
- 背包问题最新C语言版无栈适合那些没有学习C++的人参考和使用-The latest C-language version of the knapsack problem no stack reference and use for those who do not learn C++
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
acm-beibao
- acm动态规划背包问题详解一共有九讲，非常非常的实用-acm dynamic programming knapsack problem Elaborates a total of nine speakers, very very practical
Backpack-nine-speak
- 01背包模板 多重背包模板 完全背包-01 knapsack template multiple template completely backpack