brute_force_knapsack: Brute Force Knapsack Algorithm

In shaiq681/KnapSacked: An R Package to implement 'greedy search', 'brute-force search' and 'dynamic programming' on knapsack proble-set

Description

The function returns maximum value within all the possible solutions

Usage

brute_force_knapsack(x, W = NULL, ..., parallel = FALSE)

Arguments

x	data.frame, contains variables weight(w) and value(v)
W	weight threshold for the knapsack
...	arguments
parallel	boolean, if 'T' then implements parallelization

Value

Total and Maximum value within the threshold of W

References

https://en.wikipedia.org/wiki/Knapsack problem

See Also

slow_brute_force greedy_knapsack knapsack_dynamic

Examples

brute_force_knapsack(x = knapsack_objects[1:8,], W = 3500, parallel = FALSE)
brute_force_knapsack(x = knapsack_objects[1:12,], W = 3500, parallel = FALSE)
brute_force_knapsack(x = knapsack_objects[1:8,], W = 2000, parallel = FALSE)
brute_force_knapsack(x = knapsack_objects[1:12,], W = 2000, parallel = FALSE)

shaiq681/KnapSacked documentation built on Oct. 13, 2020, 1:27 a.m.