Description Usage Arguments Details Value
solution of knapsack problem based on Brute Force method
solution of knapsack problem based on Greedy Heuristic method
solution of knapsack problem based on Dynamic Programming
1 2 3 4 5 | brute_force_knapsack(x, W, parallel = FALSE)
greedy_knapsack(x, W)
knapsack_dynamic(x, W)
|
x |
a data frame containing weight and values |
W |
maximum weight |
parallel |
TRUE if brute force method is parallelized |
Knapsack Problem - Brute Force Method
knapsack problem based on Brute Force method
Knapsack Problem - Greedy Heuristic
knapsack problem based on Greedy Heuristic method
Knapsack Problem - Dynamic Programming
knapsack problem based on Dynamic Programming
returns a list of maximum value and the elements
returns a list of maximum value and the elements
returns a list of maximum value and the elements
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.