greedy_knapsack: Greedy Heuristic

Description Usage Arguments Value References

Description

Gives you an approxiamtion of the optimal solution with the Knapsack problem computed by greedy heuristic Further information about the knapsack problem https://en.wikipedia.org/wiki/Knapsack_problem

Usage

1

Arguments

x

A data frame with numeric positive values.

W

A positive numeric scalar.

Value

A list approximate of optimal value, weight and selected objects.

References

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


poceviciute/AdvRprogr_lab6 documentation built on May 7, 2019, 9:43 p.m.