文件名称:01packageProblem
介绍说明－－下载内容均来自于网络，请自行研究使用
经典的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
.................\.project
.................\src
.................\...\_01PackageProblem1
.................\...\..................\_01package1.java
.................\bin
.................\...\_01PackageProblem1
.................\...\..................\_01package1.class
.................\.settings
.................\.........\org.eclipse.jdt.core.prefs
.................\.classpath