文件名称:01packageProblem
-
所属分类：
- 标签属性：
- 上传时间：2016-08-26
-
文件大小：3.45kb
-
已下载：0次
-
提 供 者：
-
相关连接：无下载说明：别用迅雷下载，失败请重下，重下不扣分！
介绍说明－－下载内容来自于网络，使用问题请自行百度
经典的0-1背包算法，采用动态规划法。n个重量不同，价值不等的物品，放入一个承重量固定的背包中，单个物品不能拆分，求最大价值的组合。-
Classic 0-1 knapsack algorithm, using dynamic programming method. N weight is different, the value of items, into a fixed weight of the backpack, a single item can not be split, to seek the greatest value of the combination.
Classic 0-1 knapsack algorithm, using dynamic programming method. N weight is different, the value of items, into a fixed weight of the backpack, a single item can not be split, to seek the greatest value of the combination.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
_01PackageProblem/
_01PackageProblem/.project
_01PackageProblem/src/
_01PackageProblem/src/_01PackageProblem1/
_01PackageProblem/src/_01PackageProblem1/_01package1.java
_01PackageProblem/bin/
_01PackageProblem/bin/_01PackageProblem1/
_01PackageProblem/bin/_01PackageProblem1/_01package1.class
_01PackageProblem/.settings/
_01PackageProblem/.settings/org.eclipse.jdt.core.prefs
_01PackageProblem/.classpath
_01PackageProblem/.project
_01PackageProblem/src/
_01PackageProblem/src/_01PackageProblem1/
_01PackageProblem/src/_01PackageProblem1/_01package1.java
_01PackageProblem/bin/
_01PackageProblem/bin/_01PackageProblem1/
_01PackageProblem/bin/_01PackageProblem1/_01package1.class
_01PackageProblem/.settings/
_01PackageProblem/.settings/org.eclipse.jdt.core.prefs
_01PackageProblem/.classpath
本网站为编程资源及源代码搜集、介绍的搜索网站，版权归原作者所有！ 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.