搜索资源列表
贪婪算法解决背包
- 运用贪婪算法能够很好解决0/1背包问题,这是我编的一个小程序,运行过很好。-greedy algorithm can be used to solve a very good 0 / 1 knapsack problem, this is my part of a small program running very good.
0-1bagsourcecode
- 0-1背包问题的C++源代码: 设有一个背包,可以放入重量为S。现有n件物品,重量分别为S1,S2,···,Si (0<i<n+1)均为正数,从这n件物品中
0-1wenti
- 该程序是一个用动态规划法解决0-1背包问题的小程序,可以为学习动态规划法遇到困难的同学提供帮助-the program is a dynamic programming solution 0-1 knapsack problem of small procedures, to study the dynamic programming method difficulties encountered by students for help
0-1beibao
- 0-1背包问题的动态规划求解算法, 0-1背包不同于背包问题-0-1 knapsack problem of the dynamic programming algorithm, 0-1 knapsack different from the knapsack problem
0-1snap
- 算法设计与分析 第五章王晓东版的 回溯法的0-1背包问题 -algorithm design and analysis of the fifth edition of Wang Xiaodong Zhang law retroactively 0-1 knapsack problem
0-1package
- 遗传算法求解0-1背包问题,包含问题的求解步骤。-Genetic Algorithm 0-1 knapsack problem, including steps to solve the problem.
0-1questionshiyan
- 关于0-1背包问题的动态演示程序,处于实验版-0-1 knapsack problem on the Dynamic Demonstration Program, an experimental version
0-1beibao
- 0-1背包问题,采用了求最优解和求最优值,分别用递归和回代来实现.-0-1 knapsack problem using the optimal solution for the optimal value and demand, and to use recursive generation to achieve.
0-1Pack
- 用C#写的《计算机软件算法分析与设计》的作业--动态规划算法,0-1背包问题 可选择背包容量(浮点型)和指定每个物品的重量(浮点型),生成物品选择表和统计信息
0-1package
- 0-1背包问题的分支限界算法实现,有详细的函数功能说明
0-1bag
- 在c++环境下运行的程序 利用动态规划的算法思想解决0—1背包问题
0-1beibao
- 0-1背包问题的解决,此算法基于动态规划来实现,通用性好
0-1Bag
- 0-1背包问题的vc++6.0解法,还不错,供朋友们参考
0-1beibaowenti
- 用C#编写的利用遗传算法解决0-1背包问题的源程序,希望对需要的朋友有所帮助-C# prepared with the use of genetic algorithm to solve the 0-1 knapsack problem source, and they hope to help a friend in need
Knapsack_V6.0
- vc实现的0-1背包问题,一般递归方法,动态规划方法和贪心方法-vc achieved 0-1 knapsack problem, the general recursive method of dynamic programming methods and greedy method
SimulatedAnnealingAlgorithm
- matlab编制的用模拟退火算法解决0-1背包问题的具体实例-matlab prepared using simulated annealing algorithm to solve 0-1 knapsack problem specific examples of
0-1bag
- 解决0/1背包问题 : 给定一定容量的一个背包,要求放入的货物价值最大(每个货物有固定的容量和价值)-Solve the 0/1 knapsack problem: given a knapsack of a certain capacity, the requirements placed the greatest value of the goods (one for each cargo capacity and a fixed value)
0-1beibao
- 0-1背包问题~实现完整程序~直接解压缩即可~-0-1 knapsack problem ~ ~ Direct to achieve a complete decompression procedures can be ~
0-1knapsackproblem
- 动态规划解0/1背包问题knapsack problem-Dynamic programming solution 0/1 knapsack problem
0-1packageproblem
- 0-1背包问题算法源代码.0-1背包问题有很多算法变种,这是其中之一的源代码,供《算法》课的初学者使用,也可供一些研究0-1背包问题的人员作参考-0-1 package problem solvition