搜索资源列表
beibaosuanfa
- 给定n种物品和一个背包。物品i的重量是wi,体积是bi,其价值为vi,背包的容量为c,容积为d。问应如何选择装入背包中的物品,使得装入背包中物品的总价值最大?-Ideological core algorithm knapsack problem
1
- 用回溯法解决0-1背包问题,用回溯法解决0-1背包问题-用回溯法解决0-1背包问题
0-1bag
- 解决0-1背包问题的几种方法,有回溯,有优先分支界限,是一个实验报告的格式-0-1 knapsack problem to solve several methods, there are retrospective, have priority branch and bound, the format of a lab report
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
0-1bag-queastion
- 0-1背包问题 0-1背包问题的c++实现源代码 简单实用 -0-1bag queastion
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.
C-Program-examples
- 河内塔 费式数列 巴斯卡三角形 三色棋 老鼠走迷官(一) 老鼠走迷官(二) 骑士走棋盘 八个皇后 八枚银币 生命游戏 字串核对 双色、三色河内塔 背包问题(Knapsack Problem) 数、运算 蒙地卡罗法求 PI Eratosthenes筛选求质数 超长整数运算(大数运算) 长 PI 最大公因数、最小公倍数、因式分解 完美数 阿姆斯壮数 最大访客数 中序式转
[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.
beibao
- 01背包中的实现 用五种不同的方法实现-The 01 backpack realization using five different methods to achieve
beibao
- 背包问题,从m个物品中选出某几个,在背包的承重范围内使得背包的价值的最大-Knapsack problem, a few selected from the m items, making the value of the backpack in the backpack load-bearing within
QEA-solving-0-1-Knapsack-problem
- 主要是利用QEA解决0-1背包问题的程序-It isuseful to solving the problem of 0-1 Knapsack using QEA
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
main
- 基于粒子群算法的多目标搜索算法,主要解决背包问题,直接运行即可 -Multi-objective particle swarm optimization-based search algorithm, mainly to solve the knapsack problem, can be run directly
Knaspack-problems
- 背包问题,对于学习动态规划算法,有很大的帮助,系统的讲解背包问题。-Knaspack problems, It s helpful for you to study the algorithm of sotfware.