dynamic_knapsack: Dynamic Knapsack Algorithm
In Philhoels/AdvRLab6: The knapsack package
Description
Usage
Arguments
Value
References
View source: R/dynamic_programming_knapsack.R
Description
Knapsack problem solution using Dynamic Algorithm in R.
It calculates best values and weights for given capacity.
Usage
1
dynamic_knapsack(x, W)
Arguments
x
Dataframe with variables v and w.
W
Integer as capacity.
Value
Returns a list with best value and combination.
References
https://en.wikipedia.org/wiki/Knapsack_problem#0.2F1_knapsack_problem
Philhoels/AdvRLab6 documentation built on May 22, 2019, 2:16 p.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Description Usage Arguments Value References
View source: R/dynamic_programming_knapsack.R
Description
Knapsack problem solution using Dynamic Algorithm in R. It calculates best values and weights for given capacity.
Usage
1 | dynamic_knapsack(x, W)
|
Arguments
x |
Dataframe with variables v and w. |
W |
Integer as capacity. |
Value
Returns a list with best value and combination.
References
https://en.wikipedia.org/wiki/Knapsack_problem#0.2F1_knapsack_problem
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Embedding an R snippet on your website
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.