Knapsack: Knapsack Problem

Description Usage Arguments Details Value

Description

solution of knapsack problem based on Brute Force method

solution of knapsack problem based on Greedy Heuristic method

solution of knapsack problem based on Dynamic Programming

Usage

1
2
3
4
5

Arguments

x

a data frame containing weight and values

W

maximum weight

parallel

TRUE if brute force method is parallelized

Details

Knapsack Problem - Brute Force Method

knapsack problem based on Brute Force method

Knapsack Problem - Greedy Heuristic

knapsack problem based on Greedy Heuristic method

Knapsack Problem - Dynamic Programming

knapsack problem based on Dynamic Programming

Value

returns a list of maximum value and the elements

returns a list of maximum value and the elements

returns a list of maximum value and the elements


abhijeet16/shazam documentation built on Dec. 18, 2021, 9:30 p.m.