Solves knapsack, change making, subset sum, special assignment, and bin packing problems.
Can handle the classical 01 single knapsack problem for real and integer numbers. Provides exact and approximate solutions for large problem sets and for bounded and unbounded problem formulations. Certain classes of multiple knapsack and assignment problems will be solved exactly as well as approximately.
|License:||Free for research purposes and academic use.|
Hans W Borchers for the R part. The Fortran programs have beeen written by Silvano Martello and Paolo Toth for their book “Knapsack Problems” and are provided here with permission.
Maintainer: HwB <[email protected]>
Martello, S., and P. Toth (1990). “Knapsack Problems: Algorithms and Computer Implementations”. John Wiley & Sons, Ltd.
Other packages with knapsack solutions.
## See examples on the function help pages.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.