knapsack_dynamic: Knapsack Dynamic Algorithm

Description Usage Arguments Value References

View source: R/knapsack_dynamic.R

Description

The knapsack problem is a problem in combinatorial optimization: how to maximasiethe value of fitted object by fullfilling the weight constraint.

Usage

1

Arguments

x

A data frame with numeric positive values.

W

A positive numeric scalar.

Value

A list with maximum value and elements.

References

https://en.wikipedia.org/wiki/Knapsack_problem


poceviciute/AdvRprogr_lab6 documentation built on Oct. 6, 2017, 3:21 a.m.