JS2387/Group8knapsack: Solves the knapsack problem with 3 approaches - Brute Force, DP & Greedy Heuristic
Classic knapsack problem is solved with 3 approaches to get to most optimum solution with decreasing complexity The brute force algorithm check every possible combination before deciding on most optimum solution. DP reduces the problem complexity to nW by dynamically checking solution values for every knapsack object. Greedy Heuristic approach ranks objects by per unit value by object and takes objects by parts to fully utilize knapsack capacity
Getting started
Browse package contents
Package details |
|
|---|---|
| Author | c( person("Jaskirat", "Marar", email = "jasma356@student.liu.se", role = c("aut","cre")), person("Filip", "Berndtsson", email = filbe354@student.liu.se, role = "aut")) |
| Maintainer | Jaskirat Marar <jasma356@student.liu.se>, Filip Berndtsson <filbe354@student.liu.se> |
| 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:
|
