背包问题(Knapsack problem)是一种组合优化的NP完全问题。问题可以描述为：给定一组物品，每种物品都有自己的重量和价格，在限定的总重量内，我们如何选择，才能使得物品的总价格最高。问题的名称来源于如何选择最合适的物品放置于给定背包中。相似问题经常出现在商业、组合数学，计算复杂性理论、密码学和应用数学等领域中。也可以将背包问题描述为决定性问题，即在总重量不超过W的前提下，总价值是否能达到V？它是在1978年由Merkel和Hellman提出的。-Knapsack problem (Knapsack problem) is a kind of combinatorial optimization of NP complete problem. The problem can be described as: given a set of items, each item has its own weight and price, the total weight of the limit, how do we choose, in order to make the total price of the goods of the highest. The name is derived　the problem of how to choose the most appropriate items are placed in the given a backpack. Similar problems often occur in business, the combination of mathematics, computational complexity theory, cryptography and applied mathematics and other fields. Can also be described as a decisive problem knapsack problem, namely in the premise of total weight of not more than W, the total value of whether can reach V? It was proposed by Merkel and Hellman in 1978.