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], MADE.com [cph] Maintainer: Bulat Yapparov <bulat.yapparov at made.com> BugReports: https://github.com/madedotcom/mknapsack/issues License: GPL-2 URL: https://github.com/madedotcom/mknapsack NeedsCompilation: no Materials: README In views: Optimization CRAN checks: mknapsack results Documentation: Reference manual: mknapsack.pdf Downloads: Package source: mknapsack_0.1.0.tar.gz Windows binaries: r-devel: mknapsack_0.1.0.zip, r-release: mknapsack_0.1.0.zip, r-oldrel: mknapsack_0.1.0.zip 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 Linking:Please use the canonical form https://CRAN.R-project.org/package=mknapsack to link to this page.
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4