2014•International Journal of Advance Engineering and Research DevelopmentOpen access

COMPARISION OF DYNAMIC AND GREEDY APPROACH FOR KNAPSACK PROBLEM

Jay Vala, Jaymit Pandya, Dhara Monaka

Abstract

The aim of paper is to analyze few algorithms of the 0/1 Knapsack Problem. This problem is a combinatorial optimization problem in which one has to maximize the benefit of objects without exceeding capacity. As it is an NP-complete problem, an exact solution for a large input is not possible. Hence, paper presents a comparative study of the Greedy and dynamic methods. It also gives complexity of each algorithm with respect to time and space requirements. Our experimental results show that the most promising approaches is dynamic programming. Keywords-knapsack, dynamic programming, greedy programming, NP-Complete, complexity

About this research paper

What this paper is about

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Knapsack problem, Greedy algorithm, Mathematical optimization, Continuous knapsack problem, Computer science, Mathematics