Skip to content
Free planNo credit card requiredStart writing

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

Bhumi K. Joshi

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 bene fit 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

APA 7

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.

MLA 9

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.

Chicago

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.

Harvard

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.

BibTeX
@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.