Installation
About
Routines for enumerating all existing nonnegative integer solutions of a linear Diophantine equation. The package provides routines for solving 0-1, bounded and unbounded knapsack problems; 0-1, bounded and unbounded subset sum problems; additive partitioning of natural numbers; and one-dimensional bin-packing problem.
Key Metrics
Downloads
| Yesterday | 2 0% |
| Last 7 days | 45 -45% |
| Last 30 days | 270 +11% |
| Last 90 days | 731 -1% |
| Last 365 days | 3.032 -13% |
Maintainer
| Maintainer | Natalya Pya Arnqvist |