Package solves multiple knapsack optimisation problem. Given a set of items, each with volume and value, it will allocate them to knapsacks of a given size in a way that value of top N knapsacks is as large as possible.
| Label | Latest Version |
|---|---|
| main | 0.1.0 |
