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.
| Version: | 1.1-3 |
| Depends: | R (≥ 2.15.0) |
| Imports: | methods, stats |
| Published: | 2019-09-02 |
| Author: | Natalya Pya Arnqvist[aut, cre], Vassilly Voinov [aut], Rashid Makarov [aut], Yevgeniy Voinov [aut] |
| Maintainer: | Natalya Pya Arnqvist <nat.pya at gmail.com> |
| License: | GPL-2 | GPL-3 [expanded from: GPL (≥ 2)] |
| NeedsCompilation: | no |
| In views: | Optimization |
| CRAN checks: | nilde results |
| Reference manual: | nilde.pdf |
| Package source: | nilde_1.1-3.tar.gz |
| Windows binaries: | r-devel: nilde_1.1-3.zip, r-release: nilde_1.1-3.zip, r-oldrel: nilde_1.1-3.zip |
| macOS binaries: | r-release: nilde_1.1-3.tgz, r-oldrel: nilde_1.1-3.tgz |
| Old sources: | nilde archive |
Please use the canonical form https://CRAN.R-project.org/package=nilde to link to this page.