The 0/1 knapsack problem is a well known combinatorial problem which is NP-Complete.

• 摘要0/1背包问题是一类典型的组合优化问题，且属于NP完全问题。