knapsack_dynamic: Knapsack problem solve with Dynamic problem solving.

Description Usage Arguments Details Value Author(s) References

View source: R/knapsack_dynamic.R

Description

Knapsack problem solve with Dynamic problem solving.

Usage

1

Arguments

x

is a data frame hiaving 2 column 'w' and 'v' where w is weight if items and v is the value of item

W

capacity of knapsack i.e total weight that knapsack can contain in it

Details

dynamic programming algo going through all possible alternatives and return the maximum value found.

Value

return list which have maxValue and and item number of elemnts that knapsack have in it

Author(s)

rabnawaz & saman

References

https://en.wikipedia.org/wiki/Knapsack_problem#Dynamic_programming_in-advance_algorithm


rjkhan/RCourse-lab6 documentation built on May 6, 2019, 2:34 p.m.