greedy_knapsack: Greedy heuristic solve for the knapsack problem
In TeaUnn/knapsack: the knapsack package
View source: R/greedy_knapsack.r
greedy_knapsack R Documentation
Greedy heuristic solve for the knapsack problem
Description
A function that uses greedy heuristic to solve the knapsack problem
Usage
greedy_knapsack(x, W)
Arguments
x
A data frame with two variables w = weight and v = value
W
A numeric scalar with the maximum weight the knapsack is allowed to contain
Value
The function returns a list with the optimum packed value and the corresponding elements
Examples
n <- 10000
knapsack_objects <- data.frame(w = sample(1:4000, size = n, replace = TRUE),
v = runif(n = n, 0, 10000))
greedy_knapsack(x = knapsack_objects, W = 3500)
TeaUnn/knapsack documentation built on April 3, 2022, 12:02 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.
View source: R/greedy_knapsack.r
| greedy_knapsack | R Documentation |
Greedy heuristic solve for the knapsack problem
Description
A function that uses greedy heuristic to solve the knapsack problem
Usage
greedy_knapsack(x, W)
Arguments
x |
A data frame with two variables w = weight and v = value |
W |
A numeric scalar with the maximum weight the knapsack is allowed to contain |
Value
The function returns a list with the optimum packed value and the corresponding elements
Examples
n <- 10000
knapsack_objects <- data.frame(w = sample(1:4000, size = n, replace = TRUE),
v = runif(n = n, 0, 10000))
greedy_knapsack(x = knapsack_objects, W = 3500)
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.