Description: The 0-1 knapsack problem was chosen as the subject, through the use of dynamic programming, backtracking and branch and bound method algorithm to solve the problem, so as to further the understanding of the principles of various algorithms, ideas and nature, deepening of the algorithm Learn to exercise their own analysis of the various algorithms and use familiar with the software underlying algorithms and programming interface.
To Search:
File list (Check if you may need any files):
源文件\BackProblemArithmetic.java
......\BBKnapsack.java
......\BBnode.java
......\BPJ.java
......\ElemComparator.java
......\Element.java
......\HeapComparator.java
......\HeapNode.java
......\Knapsack.java
......\m.java
......\m1.java
......\MaxHeap.java
0-1背包问题.doc
源文件
Download