This package includes three different functions for solving Knapsack Problem. Functions are based on different approaches that are "brute force", "dynamic programming" and "greedy heuristic". Each approach illustrates its own computational complexity.
Package details |
|
---|---|
Maintainer | |
License | MIT + file LICENSE |
Version | 0.0.0.9000 |
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.