Two Kinds of Expanding Forms of 0-1 Knapsack Problem and Its Solution Methods
0-1背包问题的两种扩展形式及其解法*

The 0-1 knapsack problem is a classic NP-Hard problem in the combinational optimization. Because it is very hard for the solution , it is very important in the research on cryptosystem and number theory . In this paper, the 0-1 knapsack problem and its algorithm is analyzed firstly. And then this paper presents two kinds of expand form, and proposed two efficient algorithms based on dynamic programming and greedy algorithm to solve the proposed problems. Simulation results show it is effective,