dynamic_knapsack: Title Dynamic Programming-Knapsack

In Elmahi92/knpa: The knapsack package

Description

Title Dynamic Programming-Knapsack

Usage

dynamic_knapsack(x, W)

Arguments

x	Data frame consist of two columns w and v
W	Total Capacity

Value

Algorithm that can solve the knapsack problem exact by iterating over all possible values of w.

Examples

RNGversion(min(as.character(getRversion()),"3.5.3"))
set.seed(42, kind = "Mersenne-Twister", normal.kind = "Inversion")
n <- 2000
knapsack_objects <- data.frame(
w=sample(1:4000, size = n, replace = TRUE),
 v=runif(n = n, 0, 10000))
 dynamic_knapsack(x = knapsack_objects[1:8,], W = 3500)

Elmahi92/knpa documentation built on Dec. 17, 2021, 6:28 p.m.