Comparision of Dynamic and Greedy Approach for Knapsack Problem
| Author(s) | : | Jay Vala, Jaymit Pandya, Dhara Monaka |
| Institution | : | Assist. Prof. I.T. Department G H Patel College of Engg & Tech |
| Published In | : | Vol. 1, Issue 1 — January 2014 |
| Domain | : | Engineering |
| Type | : | Research Paper |
| ISSN (Online) | : | 2348-4470 |
| ISSN (Print) | : | 2348-6406 |
The aim of paper is to analyze few algorithms of the 0/1 Knapsack Problem. Thisproblem is a combinatorial optimization problem in which one has to maximize the benefit ofobjects without exceeding capacity. As it is an NP-complete problem, an exact solution for alarge input is not possible. Hence, paper presents a comparative study of the Greedy anddynamic methods. It also gives complexity of each algorithm with respect to time and spacerequirements. Our experimental results show that the most promising approaches is dynamicprogramming.
Jay Vala, Jaymit Pandya, Dhara Monaka, “Comparision of Dynamic and Greedy Approach for Knapsack Problem”, International Journal of Advance Engineering and Research Development (IJAERD), Vol. 1, Issue 1, January 2014.
