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.
Package details |
|
---|---|
Maintainer | |
License | GPL-2 |
Version | 0.1.0 |
URL | https://github.com/madedotcom/mknapsack |
Package repository | View on GitHub |
Installation |
Install the latest version of this package by entering the following in R:
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.