article · International journal of advance research and innovative ideas in education · 2017
Literature review on comparing between different approaches to solve the 0-1 knapsack problem
Cited by 0Abstract and details only
Abstract
The purpose of this paper is to analyze several algorithm design paradigms applied to a single problem - the 0/1 Knapsack Problem. The Knapsack problem is a combinatorial optimization problem where one has to maximize the benefit of objects in a knapsack without exceeding its capacity. It is an NP-complete problem and as such an exact solution for a large input is practically impossible to obtain. The main goal of the paper is to present a comparative study of the brute force, dynamic programming,and greedy algorithms. The paper discusses the complexity of each algorithm in terms of time requirements, and in terms of required programming efforts. Our experimental results show that the most promising approaches are dynamic programming.
Cite this paper
Joshi, B. K. (2017). Literature review on comparing between different approaches to solve the 0-1 knapsack problem. International journal of advance research and innovative ideas in education, 3(5), 1360–1364.
Joshi, Bhumi K. “Literature review on comparing between different approaches to solve the 0-1 knapsack problem.” International journal of advance research and innovative ideas in education, vol. 3, no. 5, 2017, pp. 1360–64.
Joshi, Bhumi K. 2017. “Literature review on comparing between different approaches to solve the 0-1 knapsack problem.” International journal of advance research and innovative ideas in education 3 (5): 1360–64.
Joshi, B.K. (2017) ‘Literature review on comparing between different approaches to solve the 0-1 knapsack problem’, International journal of advance research and innovative ideas in education, 3(5), pp. 1360–1364.
@article{joshi2017literature,
title = {{Literature review on comparing between different approaches to solve the 0-1 knapsack problem}},
author = {Joshi, Bhumi K.},
journal = {International journal of advance research and innovative ideas in education},
volume = {3},
number = {5},
pages = {1360--1364},
year = {2017}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.
Related papers
COMPARISION OF DYNAMIC AND GREEDY APPROACH FOR KNAPSACK PROBLEM
Jay Vala, Jaymit Pandya, Dhara Monaka · International Journal of Advance Engineering and Research Development · 2014
Cited by 0Open access
Comparison of Deterministic and Probabilistic Approaches for Solving 0/1 Knapsack Problem
Ritika Mahajan, Sarvesh Chopra, Sonika Jindal · Advances in intelligent and soft computing · 2012
Cited by 0
Comparison and Analysis of Algorithms for the 0/1 Knapsack Problem
Xiaohui Pan, Tao Zhang · Journal of Physics Conference Series · 2018
Cited by 14Open access
Perbandingan Algoritma Greedy dan Dynamic Programming pada Penyelesaian Knapsack Problem untuk Optimasi Pemilihan Barang
Khairany Zuhriyyah Jinan Hsb, Augis Dinanti, Muhammad Iqbal Fahrezzi et al. · Teknik Jurnal Ilmu Teknik dan Informatika · 2026
Cited by 0Open access
Review on Algorithmic Approaches to Solving Knapsack Problem
Yosra Ali Hassan, Ibrahim M. Ibrahim · Asian Journal of Research in Computer Science · 2025
Cited by 2Open access
Analyzing The Most Effective Algorithm For Knapsack Problems
Devano Fernando Boes, Kenrick Panca Dewanto, Mahesa Insan Raushanfikir et al. · International Conference on Smart Cities, Automation & Intelligent Computing Systems (ICON-SONICS) · 2023
Cited by 2
0/1 Knapsack Problem
Li Liao · Computer Knowledge and Technology · 2006
Cited by 0