搜索资源列表
背包问题之贪婪算法求解C语言源代码)
- 背包问题的贪婪算法，需要的下，不需要帐号的，自由的下。-knapsack problem of greedy algorithm, need, need not account, free under.
dongtaiguihua
- 动态规划算法的一个实例，解决0-1背包问题-dynamic programming algorithm an example to solve 0-1 knapsack problem
beibaobeibao
- 这是一个0/1背包问题的解决，有图形界面，是一次软件实习作业 -This is a 0/1 knapsack problem solving, graphics interface, the software is a practical operation
beibao
- 0_1背包问题用动态规划解给定n种物品和一背包。物品i的重量是wi，其价值为vi，背包的容量为c。问应如何选择装入背包中的物品，使得装入背包中物品的总价值最大？ 在选择装入背包的物品时，对每种物品i只有两种选择，即装入背包或不装入背包。不能将物品i装入背包多次，也不能只装入部分的物品i。因此，该问题称为0-1背包问题。-0_1 knapsack problem using dynamic programming solutio
yiqun_ziliao
- 蚁群算法源代码（附带蚁群算法在0-1背包问题和TSP问题中的应用资料两篇）-Ant colony algorithm source code (with ant colony algorithm in the 0-1 knapsack problem and the TSP data Problem 2)
0-1
- 算法设计与分析：动态规划解决0-1背包问题-Algorithm design and analysis: dynamic programming to solve 0-1 knapsack problem
A_solution_to-knapsack-problem
- 背包问题是组合优化领域内经典的NP完备间题,本文介绍了pso解决0/1背包问题上的一个方法-Knapsack problem is the field of combinatorial optimization of NP complete classic inter-title, this article introduced the PSO to solve 0/1 knapsack problem on one of the wa
Antbeibao
- 用蚁群算法解决0-1背包问题,matlab实现,自己亲自写的,没问题-Using ant colony algorithm to solve 0-1 knapsack problem, matlab realize that he personally wrote, no problem
0-1
- 解决0-1背包问题的 还可以哈 就这些了 希望对大家有用-Solve the 0-1 knapsack problem, they can still hope for Kazakhstan on these useful for everyone
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
Knapsack_V6.0
- vc实现的0-1背包问题，一般递归方法，动态规划方法和贪心方法-vc achieved 0-1 knapsack problem, the general recursive method of dynamic programming methods and greedy method
an
- 利用模拟退火解决0-1背包问题，适合初学者。-The use of simulated annealing to solve 0-1 knapsack problem, suitable for beginners.
Fac3_9
- //0-1背包问题动态规划解法，原自王晓东算法设计，该程序已调通-//0-1 knapsack problem dynamic programming method, the original algorithm since Xiaodong design, the program has been transferred Qualcomm
GA
- 本程序是在MATLAB平台上，利用智能优化算法遗传算法来解决01背包问题。在0 / 1背包问题中，需对容量为c 的背包进行装载。从n 个物品中选取装入背包的物品，每件物品i 的重量为wi ，价值为pi 。对于可行的背包装载，背包中物品的总重量不能超过背包的容量，最佳装载是指所装入的物品价值最高。-This procedure is in the MATLAB platform using intelligent genetic algo
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
- 0-1背包问题，典型的动态规划问题的实现过程-0-1 knapsack problem, a typical dynamic programming problem of the realization of the process! ! !
0-1beibao
- 0-1背包问题~实现完整程序~直接解压缩即可~-0-1 knapsack problem ~ ~ Direct to achieve a complete decompression procedures can be ~
SA
- 这是用模拟退火算法解决0-1背包问题，下载后可直接运行，可以帮助有需要对模拟退火算法进行了解的朋友。-This is a simulated annealing algorithm to solve the 0-1 knapsack problem, after downloading, can be directly run, you can help those in need of the simulated annealing
pso_01
- 使用二进制PSO解决0-1背包问题的MATLAB程序-The use of PSO to solve 0-1 knapsack problem
0-1hui
- 0-1背包问题 关于回溯法的背包问题 回溯法在求问题的所有解时, 要回溯到根结点, 且根结点的所有子树都已被搜索过才结束。-0-1 背包问题