brute_force_knapsack: brute_force_knapsack function
In JS2387/Group8knapsack: Solves the knapsack problem with 3 approaches - Brute Force, DP & Greedy Heuristic
Description
Usage
Arguments
Value
View source: R/brute_force_knapsack.R
Description
evaluates the solution for knapsack problem by calculating sum of weights & profits for each combination possible for given input
Usage
1
brute_force_knapsack(x, W, parallel = FALSE)
Arguments
x
as a data.frame containing the weights and values of knapsack objects with column names 'w' & 'v' respectively
W
as a numeric value defining the constraint of the knapsack capacity
parallel
as a logical to specify if the code should be parallelized or not. Default value is FALSE
Value
list containing sum of values of chosen elements and the reference of the elements chosen in the final solution
JS2387/Group8knapsack documentation built on Dec. 18, 2021, 12:27 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
evaluates the solution for knapsack problem by calculating sum of weights & profits for each combination possible for given input
Usage
1 | brute_force_knapsack(x, W, parallel = FALSE)
|
Arguments
x |
as a |
W |
as a |
parallel |
as a |
Value
list containing sum of values of chosen elements and the reference of the elements chosen in the final solution
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.