Description: To achieve the classic 0-1 knapsack problem, dynamic programming, branch and bound, backtracking, greedy algorithm to achieve the four algorithms are 0-1 knapsack problem, and there is a Four in One of the four methods used to achieve a unified algorithm. And its time complexity is analyzed.
To Search:
File list (Check if you may need any files):
刘永忠(112009321001992)算法分析\分枝限界\Cga.bgi
...............................\........\Egavga.bgi
...............................\........\fengzhijiaixian.c
...............................\........\FENGZH~1.EXE
...............................\........\FENGZH~1.OBJ
...............................\动态规划\Cga.bgi
...............................\........\dynamic.c
...............................\........\DYNAMIC.EXE
...............................\........\DYNAMIC.OBJ
...............................\........\Egavga.bgi
...............................\四算法合一总算法\allFour.c
...............................\................\ALLFOUR.EXE
...............................\................\ALLFOUR.OBJ
...............................\................\Cga.bgi
...............................\................\Egavga.bgi
...............................\回溯法\Cga.bgi
...............................\......\Egavga.bgi
...............................\......\huisuo.c
...............................\......\HUISUO.EXE
...............................\......\HUISUO.OBJ
...............................\时间复杂度分析.doc
...............................\贪心算法\Cga.bgi
...............................\........\Egavga.bgi
...............................\........\greedy.c
...............................\........\GREEDY.EXE
...............................\........\GREEDY.OBJ
...............................\运行说明文档.txt
...............................\分枝限界
...............................\动态规划
...............................\四算法合一总算法
...............................\回溯法
...............................\贪心算法
刘永忠(112009321001992)算法分析
Download