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.
https://anaconda.org/r/r-mknapsack/badges/version.svg
https://anaconda.org/r/r-mknapsack/badges/latest_release_date.svg
https://anaconda.org/r/r-mknapsack/badges/latest_release_relative_date.svg
https://anaconda.org/r/r-mknapsack/badges/platforms.svg
https://anaconda.org/r/r-mknapsack/badges/license.svg
https://anaconda.org/r/r-mknapsack/badges/downloads.svg