搜索资源列表
贪婪算法解决背包
- 运用贪婪算法能够很好解决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.
背包问题的遗传算法解法vb
- 这是一用VB解决背包问题的遗传算法元程序,程序框架清楚,应用性强-This a backpack with VB solve problems of genetic algorithm yuan procedure is a clear fr a mework and application-
GA_01Knap
- 用遗传算法解决背包问题,可以求最优解,也可以自己设定次数-using genetic algorithms to solve knapsack problem, the optimal solution can help, can set its own number
AlgorithmicDesign
- 师兄做的算法可视化演示程序,里面包括排序背包问题等等,界面很炫,VC6下测试通过。-Hold do algorithm visualization demo program that included issues such as ordering backpacks, cool interface, VC6 under test.
fjdjf
- 用分支界限法解决的几个问题:包括0-1背包问题,最大团问题,电路布线问题,最大装载问题.作业最优处理问韪.-branch line with the law to solve several problems : including 0-1 knapsack problem, the largest group, circuit wiring problem, the greatest problem loading. Optimal
PackageProblem
- 实现背包问题 package problem 1. 问题描述 假设有一个能装入总体积为T的背包和n件体积分别为w1 , w2 , … , wn 的物品,能否从n件物品中挑选若干件恰好装满背包,即使w1 +w2 + … + wn=T,要求找出所有满足上述条件的解。例如:当T=10,各件物品的体积{1,8,4,3,5,2}时,可找到下列4组解: (1,4,3,2)、(1,4,5)、(8,2)、(3,5,2)。 2. 基本
questionofback
- 经典背包问题的一种解法,c语言编写的,比较小的程序-classic knapsack problem of a solution, c language, the procedure is relatively small
beibaobeibao
- 这是一个0/1背包问题的解决,有图形界面,是一次软件实习作业 -This is a 0/1 knapsack problem solving, graphics interface, the software is a practical operation
beibaowentichengxu
- 一个关于算法分析的背包问题小程序 -an algorithm analysis on the small knapsack problem procedures.
DynamicKnap
- 动态规划背包问题,对算法初学者有极大的参考价值!-dynamic programming knapsack problem, the algorithm beginners have great reference value!
0-1huisu
- 0-1背包回溯 0-1背包回溯 0-1背包回溯 0-1背包回溯 0-1背包回溯 -0-1 knapsack Retrospective 0-1 knapsack retrospective 0-1 knapsack retrospective 0-1 knapsack retrospective knapsack retrospective 0-1 knapsack retrospective knapsack retrospectiv
greedy_bag
- 背包算法,算法课的实验。基本上已经完善!-knapsack algorithm, the algorithm class experiment. Basically perfect!
bag8
- 八种背包问题的所有源代码,对于学习算法的人很有用:)-eight backpackers of all source code, for the learning algorithm useful :)
si
- 设有一个背包可以放入的物品重量最重为s,现有n件物品,它们的重量分别为w[0]、 w[1]、w[2]、…、w[n-1]。问能否从这n件物品中选择若干件放入此背包中,使得放入的重量之和正好为s。如果存在一种符合上述要求的选择,则称此背包问题有解(或称其解为真);否则称此背包问题无解(或称其解为假)。试用递归方法设计求解背包问题的算法。-There is a backpack weight items can be placed the m
01packet
- 用4种方式写01背包算法程序,对结果进行比较-4 ways to write 01 backpack algorithm procedures, comparison of results
Branch_Bound_Knap
- 分支限界背包算法实现,用VC++6.0开发。-Branch and bound algorithm backpack with VC++ 6.0 development.
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