README
¶
Knapsack
The Knapsack Problem is a combinatorical optimization problem. Given a set of items, each with a weight 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.
Directories
Click to show internal directories.
Click to hide internal directories.