alede379/lab6: Knapsack problem algorithms
The knapsack problem is a discrete optimization problem, in the package there are three different algorithms to approach it: Brute force search, Dynamic programming, Greedy heuristic.
Getting started
Browse package contents
Package details |
|
|---|---|
| Author | Barakat Bruno [aut, cre], De Biase Alessia [aut] |
| Maintainer | Alessia De Biase <alessia_debiase@libero.it> |
| License | GPL |
| Version | 1.0 |
| Package repository | View on GitHub |
| Installation |
Install the latest version of this package by entering the following in R:
|
