The package provides three different algorithms for solutions to the knapsack problem, each with different computational complexity. One provides the optimal solution, but is very computationally expensive, one is computationally cheaper but provides an optimal solution only for integer weights and the third one is a heuristic which is computationally even cheaper but the solution is not expected to be as good as for the other two algorithms.
Package details |
|
---|---|
Maintainer | |
License | MIT + file LICENSE |
Version | 1.0 |
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.