Description: 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.
To Search:
File list (Check if you may need any files):
BeiBao.doc
Download