mknapsack: Multiple Knapsack Problem Solver

Package solves multiple knapsack optimisation problem. Given a set of items, each with volume and value, it will allocate them to knapsacks of a given size in a way that value of top N knapsacks is as large as possible.

Version: 0.1.0
Imports: assertthat, data.table, lpSolve
Suggests: testthat, mockery, Rglpk, ROI, ROI.plugin.glpk
Published: 2018-04-10
DOI: 10.32614/CRAN.package.mknapsack
Author: Bulat Yapparov [aut, cre], [cph]
Maintainer: Bulat Yapparov <bulat.yapparov at>
License: GPL-2
NeedsCompilation: no
Materials: README
In views: Optimization
CRAN checks: mknapsack results


Reference manual: mknapsack.pdf


Package source: mknapsack_0.1.0.tar.gz
Windows binaries: r-devel:, r-release:, r-oldrel:
macOS binaries: r-release (arm64): mknapsack_0.1.0.tgz, r-oldrel (arm64): mknapsack_0.1.0.tgz, r-release (x86_64): mknapsack_0.1.0.tgz, r-oldrel (x86_64): mknapsack_0.1.0.tgz


Please use the canonical form to link to this page.