The knapsack problem or rucksack problem is a problem in combinatorial optimization: Given a set of items, each with a mass and a value, determine the number of each item to include in a collection so that the total weight is less than or equal to a given limit and the total value is as large as possible. It derives its name from the problem faced by someone who is constrained by a fixed-size knapsack and must fill it with the most valuable items.
http://en.wikipedia.org/wiki/Knapsack_problem
Basically, its a solver for a variation of this problem, the knapsack 0/1 problem
Last updated on 2018年04月24日
此版本包含小幅错误修复和常规改进。请更新至最新版本，以获得更佳体验。
