PatrickSVM/knapsack: Algorithms to solve the knapsack problem
This packlage implements three different algorithms for solving the knapsack problem: Brute force, dynamic programming and greedy heuristic.
Getting started
Browse package contents
Package details |
|
|---|---|
| Author | Patrick Hiemsch |
| Maintainer | Patrick Hiemsch <patrick.hiemsch@gmail.com> |
| License | GPL (>= 3) |
| Version | 0.1.0 |
| Package repository | View on GitHub |
| Installation |
Install the latest version of this package by entering the following in R:
|
