搜索资源列表
0-1beibao
- 0-1背包问题的解决，此算法基于动态规划来实现，通用性好-0-1 knapsack problem, this algorithm is based on dynamic programming to achieve, common good
pack1
- 01背包问题 用算法分之方法解决的问题-01 knapsack problem with algorithms to solve the problem of points
KnapsackProblem
- 背包问题是一个经典的动态规划模型。它既简单形象容易理解，又在某种程度上能够揭示动态规划的本质-Knapsack problem is a classic dynamic programming model. It is simple and easy to understand images, but also to some extent, able to reveal the essence of dynamic programmi
tanxin
- 背包问题 贪心法C++实现 功能健康，绝对无毒-Greedy Knapsack Problem C++ Achieve functional health, is absolutely non-toxic
bagcopy
- 采用遗传算法解决０-１背包问题 并采用了二重编码形式
GA
- 基于遗传算法的背包问题求解，有基本的说明和代码 其他人不需帐号就可自由下载此源码 -Based on genetic algorithms for solving knapsack problem, some basic instructions and code other people without accounts can download this free source
OIknap
- 用VC编写的01背包问题,功能强大,是在老师的指导下完成的,大家可以用来参考-VC prepared with 01 knapsack problem, powerful, is completed under the guidance of teachers, and everyone can be used to reference
01beibaozhenghechengxu
- 背包问题非常有用的程序代码打包，包括贪心，回溯，动态规划-Knapsack problem is very useful package of program code, including greedy, backtracking, dynamic programming
Antbeibao
- 用蚁群算法解决0-1背包问题,matlab实现,自己亲自写的,没问题-Using ant colony algorithm to solve 0-1 knapsack problem, matlab realize that he personally wrote, no problem
Knap2
- knap2 背包问题非递归，运用栈及回溯算法优化了一下，可以找到所有满足条件的解。 如果遇到什么问题，请发邮件至horsewhite32@hotmail.com,笔者将不胜感激 uuhorse-non-recursive knap2 knapsack problem, the use of stack and the backtracking algorithm to optimize the look, you can f
LCKNAP
- 01背包问题的优先队列式分枝限界算法程序LCKNAP-01 knapsack problem the priority queue algorithm Branch and Bound-style program LCKNAP
beibaowenti
- 动态规划求01背包问题. 动态规划求01背包问题.-Dynamic programming for knapsack problem 01. Dynamic programming for knapsack problem 01.
beibao
- 0-1背包问题（0-1 Knapsack Problem）的定义为：设集合 代表m件物品,正整数 分别表示第 件物品的价值与重量，那么0-1背包问题KNAP(A,c)定义为,求A的子集，使得重量之和小于背包的容量c，并使得价值和最大。-0-1 knapsack problem (0-1 Knapsack Problem) is defined as: set up a collection on behalf of m items, r
dividablepackage
- 此程序是使用Java编写的，实现了可分割的0/1背包问题。程序主要是是使用了经典的贪心算法，能够很好的解决此问题。-This procedure is to use Java prepared to achieve that can be separated from 0/1 knapsack problem. Procedure is mainly the use of a classic greedy algorithm that
beibao
- 用回溯法求解0-1背包问题 用vc++实现 包含完整源代码 经过测试成功！-Retrospective method with 0-1 knapsack problem with vc++ Achieve that contains a complete source code has been tested successfully!
BagZeroOne
- java语言实现动态规划求解0-1背包问题。-java dynamic programming language for solving 0-1 knapsack problem.
Solving.the.01.Knapsack.Problem.with.Genetic.Algor
- 遗传算法求解01背包问题＋实验报告＋参考文献。如果你看了这个程序还是不能明白遗传算法的巧妙，那么还是不要再看这个问题了。-Genetic Algorithm for Knapsack Problem 01 experimental report references. If you read this procedure should not understand the genetic algorithm or clever,
01beibao
- 0-1背包问题，用VC++实现，是算法设计中比较重要的问题-0-1 knapsack problem, using VC++ Realize is that algorithm design more important issue
2
- 用回溯解背包问题 假设有n件物品，定义一个结构体a[]来存储，结构体有两个成员weight和value(weight表示重量，value表示价值)先定义一个数组col[]表示每个物品当前状态（为1表示被选，为0表示未被选），其初值全为1，从下标为0开始遍历，当前所选物品总重和总价值分别设为tw和tv（初值均为0），背包的限重设为limit，若第i个物品满足tw+a[i].weight<=limit且col[i]==1 就将a[i]
beibao
- 背包问题运用贪婪算法的matlab 程序实现-Use of greedy algorithm knapsack problem of matlab program