brute_force_knapsack: An implementation of the brute force solution to the knapsack...
In SimonJonsson/lab6: LAB6 different knapsack solutions
View source: R/brute_force_knapsack.R
Description
An implementation of the brute force solution to the knapsack problem
Where we list all possible combinations of a vector with size {0,1}\*n and then make it into
a matrix and check each row for best possible value. The matrix has the size 2^n rows and n columns.
Usage
1
brute_force_knapsack(x, W, parallel = FALSE)
Arguments
x
data.frame with two vectors of the same size, v with values and w with weights
W
an integer as the total weight of the knapsack
parallel
boolean deciding if computation should be done in parallel or concurrent
SimonJonsson/lab6 documentation built on May 7, 2019, 2:53 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/brute_force_knapsack.R
Description
An implementation of the brute force solution to the knapsack problem Where we list all possible combinations of a vector with size {0,1}\*n and then make it into a matrix and check each row for best possible value. The matrix has the size 2^n rows and n columns.
Usage
1 | brute_force_knapsack(x, W, parallel = FALSE)
|
Arguments
x |
data.frame with two vectors of the same size, v with values and w with weights |
W |
an integer as the total weight of the knapsack |
parallel |
boolean deciding if computation should be done in parallel or concurrent |
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.