Description Usage Arguments Value References
Gives you the optimal solution with the Knapsack problem computed by brute force. Further information about the knapsack problem https://en.wikipedia.org/wiki/Knapsack_problem
1 | brute_force_knapsack(x, W, parallel = FALSE)
|
x |
A data frame with numeric positive values. |
W |
A positive numeric scalar. |
parallel |
Set to TRUE computation to be run on all cores. |
A list with optimal value, weight and selected objects.
https://en.wikipedia.org/wiki/Knapsack_problem
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.