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

Package details

AuthorBulat Yapparov [aut, cre], MADE.com [cph]
MaintainerBulat Yapparov <[email protected]>
LicenseGPL-2
Version0.1.0
URL https://github.com/madedotcom/mknapsack
Package repositoryView on CRAN
Installation Install the latest version of this package by entering the following in R:
install.packages("mknapsack")

Try the mknapsack package in your browser

Any scripts or data that you put into this service are public.

mknapsack documentation built on April 10, 2018, 5:05 p.m.