An example of the use of the Knapsack algorithm. Each item has a weight and value and the "knapsack" has a max weight that it can hold. The algorithm's job is to find the combination of items that maximizes the value while maintaining a weight <= to the knapsacks max weight.
BeauCranston/KnapsackAlgorithm
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|