Two Algorithms Based on 0-1 Knapsack Problem

The 0-1 knapsack problem is a classical problem in Computer Science, 0-1 knapsack problem is an optimization problem. Because of its simple structure, strong scalability, it can be used as sub problems of other problems. Therefore the research can solve more complex optimization problems. This paper summarizes the two kinds of algorithms to solve 0-1 knapsack problem,finally two algorithms are compared and analyzed.