Using java language, using branch and bound algorithms 0-1 knapsack problem, the algorithm easy to understand!




File list:
0-1背包
....\BBKnapsack.class
....\BBKnapsack.java
....\BBnode.class
....\BBnode.java
....\HeapNode_W.class
....\HeapNode_W.java
....\MaxHeap.class
....\MaxHeap.java
....\MergeSort.class
....\MergeSort.java