Nothing
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.
Getting started
Browse package contents
Package details |
|
|---|---|
| Author | Bulat Yapparov [aut, cre], MADE.com [cph] |
| Maintainer | Bulat Yapparov <bulat.yapparov@made.com> |
| License | GPL-2 |
| Version | 0.1.0 |
| URL | https://github.com/madedotcom/mknapsack |
| Package repository | View on CRAN |
| Installation |
Install the latest version of this package by entering the following in R:
|
Try the mknapsack package in your browser
Any scripts or data that you put into this service are public.
