文件名称:01bag
- 所属分类：
- 数据结构常用算法
- 资源属性：
- [C/C++] [源码]
- 上传时间：
- 2012-11-26
- 文件大小：
- 221kb
- 下载次数：
- 0次
- 提 供 者：
- liuyon******
- 相关连接：
- 无
- 下载说明：
- 别用迅雷下载，失败请重下，重下不扣分！
介绍说明－－下载内容均来自于网络，请自行研究使用
实现经典0-1背包问题，采用动态规划、分枝限界、回溯法、贪心算法等四个算法分别实现0-1背包问题，并有一个四合一的算法统一用四种方法实现。并对其时间复杂度进行了分析。-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.
相关搜索： 01bag
(系统自动生成,下载前可以参看下载内容)
下载文件列表
刘永忠(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)算法分析
...............................\........\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)算法分析