brute_force_knapsack: Brute Force Knapsack
In faridmusayev/R_lab06: Knapsack Problem
Description
Usage
Arguments
Value
View source: R/brute_force_knapsack.R
Description
This algorithm estimates how to put available items into the knapsack
in order to get the maximum possible value less than weight of knapsack.
Here brute force approach is implemented that means all possible
combinations of items O(2^n) are considered.
Usage
1
brute_force_knapsack(x, W, parallel = FALSE)
Arguments
x
Data frame with two numeric columns: weights and values
W
Total weight of the knapsack
parallel
logical parameter for parallel computation
Value
List with numbers of items that can be put into knapsack and maximum obtained value
faridmusayev/R_lab06 documentation built on Dec. 20, 2021, 7:44 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
View source: R/brute_force_knapsack.R
Description
This algorithm estimates how to put available items into the knapsack in order to get the maximum possible value less than weight of knapsack. Here brute force approach is implemented that means all possible combinations of items O(2^n) are considered.
Usage
1 | brute_force_knapsack(x, W, parallel = FALSE)
|
Arguments
x |
Data frame with two numeric columns: weights and values |
W |
Total weight of the knapsack |
parallel |
logical parameter for parallel computation |
Value
List with numbers of items that can be put into knapsack and maximum obtained value
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.