搜索资源列表
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
3.2
- 作品：算法设计课程作业 作者：陈兴 学号：J04120010 操作说明： 1、最长公共子序列： 用VC6.0打开文件以后输入一串数字，按“\\”为结束，输出结果。 2、背包问题 用vc6.0打开文件以后按提示操作。 3、残缺棋盘问题 用vc6.0打开文件以后按提示操作。 4、（3.1和3.2还有3.3） 这个是课本82页的作业，基本实现了。其中3.2的算法时间复杂度不是nlogn而是n，nlogn的算法没做出来！ -e
bag01
- 解决0-1背包问题 欢迎批评指正-0-1 knapsack problem solving welcome criticism correction
Fractionalbag
- 关于分数背包的解决 欢迎批评指教-scores knapsack on the settlement welcome comments and suggestions
beibaotanxin
- 普通背包问题的贫心算法C语言解法,在Windows系统下Wintc编写-ordinary knapsack problem of poor heart algorithm C language method, in the Windows system under preparation Wintc
01BEIBAOdongtai
- 0-1背包问题的动态规划算法C语言实现.Windows系统下 Wintc环境编写-0-1 knapsack problem of the dynamic programming algorithm C language. Windows systems Wintc Central Habitat prepared
greedy_bag
- 背包算法，算法课的实验。基本上已经完善！-knapsack algorithm, the algorithm class experiment. Basically perfect!
TSPTravelingsalesmanproblem
- 完全图哈密尔顿圈的遗传模拟退火算法matlab通用源程序拟退火算法解0－1背包问题MATLAB源代码 -complete graph Hamilton Circle genetic simulated annealing Matlab to be definitive source solution annealing 0 - a knapsack problem MATLAB source code
GenerationAl
- 用遗传算法解0/1背包问题，背包问题是著名的NP完备类困难问题，此处给出解法。-Genetic Algorithm for 0 / 1 knapsack problem, knapsack problem is a well-known class of NP-complete problems. Solution is here.
beibao_loca
- 经典问题，背包问题VB版，有简单窗口界面，操作简单-classic problem, knapsack problem VB version, a simple window interface, simple operation
017387-01
- 论坛代码 用分支界限法解决的几个问题:包括0-1背包问题,最大团问题,电路布线问题,最大装载问题.作业最优处理问韪-Forum with the branch code boundaries to solve several problems : including 0-1 knapsack problem, the largest group, circuit wiring problem, the greatest problem loading. Optimal operating han
Chp15
- 背包问题的遗传算法解法 背包问题的遗传算法解法-knapsack problem genetic algorithm method knap sack problem GA knapsack asked Solution that the genetic algorithm method knapsack problem Genetic Algorithm Solution
OI
- 用多种算法解决0－1背包问题，包括回朔法，动态规划，贪心算法等-algorithm used to solve a variety of 0-1 knapsack problem, including the retrospective method, dynamic programming, greedy algorithm
knapsack012
- 0/1/2背包问题,从文件输入,从文件输出.里面有详细的报告和程序说明文档-0/1/2 knapsack problem from the file input and output from the document. There are detailed reports and documentation procedures
huishu01beibao
- 回朔解决0-1背包,里面有VC++的代码,可供大家参考,如里有误的,请和我联系-retrospective resolve 0-1 knapsack containing a VC code, for your reference, if there are mistaken. and please contact me! !
packageone
- 背包算法和0-1背包算法,c++实现,希望对大家有帮助!-knapsack algorithm and 0-1 knapsack algorithm, c achieve, and I hope to be helpful!
cqa
- 背包问题的遗传算法解法-knapsack problem Genetic Algorithm Solution
背包问题的遗传算法解法
- 背包问题算法解决-Knapsack Problem Solving
fenzhidingjie beibao
- 分支定界的0/1背包问题-branch delimitation of the 0 / 1 knapsack problem
0-1bag
- 3，算法设计0-1背包，要求用整形-3, 0-1 knapsack algorithm design and required plastic surgery