dynamic_knapsack: Solve knapsack problem by Dynamic programming. This approach...

Description Usage Arguments Value Examples

Description

Solve knapsack problem by Dynamic programming. This approach is of complexity O(Wn).

Usage

1

Arguments

x

data.frame, first column x:weight of object, second column v:value of object

W

numeric, weight limit of knapsack

Value

list, value: total value of objects, elements: the rows of objects

Examples

1
2

shihs/LiUAdRLab6 documentation built on May 30, 2019, 7:18 a.m.