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.

源文件\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
源文件

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．