搜索资源列表
thesis2000_fangqi
- 算法分析和设计的主要原理,动态规划 贪心算法 背包问题的实例-algorithm analysis and design of the main principle of dynamic programming greedy algorithm examples knapsack problem
algrithm
- 算法设计与分析的经典程序，主要有0-1背包问题，最小生成树等。-algorithm design and analysis of the classic procedure, mainly 0-1 knapsack problem, such as minimum spanning tree.
knap1
- 0-1背包问题 附带界面 用两种方法实现-0-1 knapsack problem fringe interface used in two ways
0_1bag
- 程序功能：已知一定容量的背包和一定重量、一定个数的物品，背包容量、物品重量和物品个数可以自己设定，要求向背包中装入物品，使装入的物品恰好为被包的最大容量。若没有这样的物品组合，则输出“No available combination !”。-procedures functions : some capacity known knapsack and a certain weight, a certain number of items, bags capacity, weight and th
Chp15
- 背包问题的遗传算法解法 背包问题的遗传算法解法-knapsack problem genetic algorithm method knap sack problem GA knapsack asked Solution that the genetic algorithm method knapsack problem Genetic Algorithm Solution
abcd
- 贪婪算法解决背包问题-greedy algorithm to solve knapsack problem
dynamic
- 动态规划解决0-1背包问题-0-1 knapsack problem
背包问题的动态规划法算法(c++)
- 数据结构 算法设计与分析背包问题的动态规划法算法-data structure design and analysis of algorithms knapsack problem of dynamic programming algorithm
POS_c
- 本程序是用PSO用于求解NP难问题，如0-1背包问题，效果很好-This procedure is used PSO for solving the NP hard problems, such as 0-1 knapsack problem, well
Knapsack
- nb!这是一个nb的代码，这是一段神奇的代码，它可以帮助你做任何事情。-nb!this is a nobiable program which can help you do everything you ordered!
BB
- 对背包问题进行研究 用MATLAB来实现-Knapsack problem using MATLAB to realize
Matlab
- quantm computing applicad to knapsack problem
knapsack-problem
- the knapsack problem
0-1beibao
- 这是用MFC写的，开发环境是VC++。有软件界面，主要用于求解0-1背包问题，亲测无误。-This is written in MFC, and the development environment is VC++. It has software interface, mainly for solving 0-1 knapsack problem.