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.


Reference manual

It appears you don't have a PDF plugin for this browser. You can click here to download the reference manual.


1.1-4 by Natalya Pya Arnqvist, 7 months ago

Browse source code at

Authors: Natalya Pya Arnqvist[aut, cre] , Vassilly Voinov [aut] , Rashid Makarov [aut] , Yevgeniy Voinov [aut]

Documentation:   PDF Manual  

Task views: Optimization and Mathematical Programming

GPL (>= 2) license

Imports methods, stats

Suggests parallel, lpSolve, TSP

See at CRAN