Package: nilde 1.1-7
Natalya Pya Arnqvist
nilde: Nonnegative Integer Solutions of Linear Diophantine Equations with Applications
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.
Authors:
nilde_1.1-7.tar.gz
nilde_1.1-7.tar.gz(r-4.5-noble)nilde_1.1-7.tar.gz(r-4.4-noble)
nilde_1.1-7.tgz(r-4.4-emscripten)nilde_1.1-7.tgz(r-4.3-emscripten)
nilde.pdf |nilde.html✨
nilde/json (API)
# Install 'nilde' in R: |
install.packages('nilde', repos = c('https://cran.r-universe.dev', 'https://cloud.r-project.org')) |
This package does not link to any Github/Gitlab/R-forge repository. No issue tracker or development information is available.
Last updated 2 years agofrom:4388a92308. Checks:OK: 2. Indexed: yes.
Target | Result | Date |
---|---|---|
Doc / Vignettes | OK | Dec 03 2024 |
R-4.5-linux | OK | Dec 03 2024 |
Exports:bin.packingget.knapsackget.partitionsget.subsetsumnldeprint.knapsackprint.nldeprint.partitionsprint.subsetsumprint.tsp_solvertsp_solver
Dependencies:
Readme and manuals
Help Manual
Help page | Topics |
---|---|
Nonnegative Integer Solutions of Linear Diophantine Equations with Applications | nilde-package nilde |
Enumeration of all existing solutions for one-dimensional bin-packing problem | bin.packing |
Enumeration of all existing nonnegative integer solutions for unbounded, bounded and 0-1 knapsack and subset sum problems | get.knapsack |
Additive partitioning of natural numbers | get.partitions |
Enumeration of all existing 0-1 and bounded solutions of a subset sum problem | get.subsetsum |
Enumeration of all existing nonnegative integer solutions of a linear Diophantine equation | nlde |
Print partitions object. | print.knapsack print.nlde print.partitions print.subsetsum print.tsp_solver |
Travelling salesperson problem solver | tsp_solver |