Description:
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.
To Search:
File list (Check if you may need any files):
_01PackageProblem
.................\.project
.................\src
.................\...\_01PackageProblem1
.................\...\..................\_01package1.java
.................\bin
.................\...\_01PackageProblem1
.................\...\..................\_01package1.class
.................\.settings
.................\.........\org.eclipse.jdt.core.prefs
.................\.classpath
Download