This package contains three different functions for solving what is called the knapsack problem. The first one is Brute force search,the second one uses dynamic programming and the last one is the Greedy aproach.
|Maintainer||The package maintainers <[email protected]>, <[email protected]>, <[email protected]>|
|License||MIT+ file LICENSE|
|Package repository||View on GitHub|
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.