knapsack_dynamic: Knapsack Dynamic Algorithm
In poceviciute/AdvRprogr_lab6: Knapsack
Description
Usage
Arguments
Value
References
Description
The knapsack problem is a problem in combinatorial optimization: how to maximasiethe value of fitted object by fullfilling the weight constraint.
Usage
1
knapsack_dynamic(x, W)
Arguments
x
A data frame with numeric positive values.
W
A positive numeric scalar.
Value
A list with maximum value and elements.
References
https://en.wikipedia.org/wiki/Knapsack_problem
poceviciute/AdvRprogr_lab6 documentation built on May 7, 2019, 9:43 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
Description
The knapsack problem is a problem in combinatorial optimization: how to maximasiethe value of fitted object by fullfilling the weight constraint.
Usage
1 | knapsack_dynamic(x, W)
|
Arguments
x |
A data frame with numeric positive values. |
W |
A positive numeric scalar. |
Value
A list with maximum value and elements.
References
https://en.wikipedia.org/wiki/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.