Skip to Main Content
The purpose of this paper is to analyze several algorithm design paradigms applied to single problem - 0/1 Knapsack Problem. The Knapsack Problem is a combinatorial optimization problem where one has to maximize the benefits of objects in a knapsack without exceeding its capacity. It is an NP-complete problem and uses exact and heuristic techniques to get solved. The objective is to analyze that how the various techniques like Dynamic Programming, Greedy Algorithm and Genetic Algorithm affect the performance of Knapsack Problem.
Date of Conference: 7-8 Jan. 2012