greedy_knapsack: Largest possible value in weighted bag - greedy
In zoepatton/Lab6: The Knapsack Problem
Description
Usage
Arguments
Value
Description
This function takes the values and weights provided in a data frame and finds the largest possible sum of values that is less than or equal to the inputed weight by ordering each element by value per weight.
Usage
1
greedy_knapsack(x, W)
Arguments
x
data frame
W
positive numeric value
Value
The output will be a numerical value(the largest possible sum) and the corresponding numerical elements that make that sum
zoepatton/Lab6 documentation built on Oct. 31, 2020, 1:15 a.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
Description
This function takes the values and weights provided in a data frame and finds the largest possible sum of values that is less than or equal to the inputed weight by ordering each element by value per weight.
Usage
1 | greedy_knapsack(x, W)
|
Arguments
x |
data frame |
W |
positive numeric value |
Value
The output will be a numerical value(the largest possible sum) and the corresponding numerical elements that make that sum
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.