Solving Knapsack Problem using Dynamic Programming

Authors

  • Sriyani Violina Informatics Department, Engineering Faculty, Widyatama University Jalan Cikutra No 204A Bandung Author
  • Iwa Ovyawan Herlistiono Informatics Department, Engineering Faculty, Widyatama University Jalan Cikutra No 204A Bandung Author

Keywords:

Dynamic Programming, Discrete Knapsack

Abstract

Dynamic Programming is an algorithm or method in solving complex problems by describing how to solve them in several stages by dividing the problem into simpler problems. So that each stage of completion is related to each other until a final solution is produced. The Knapsack problem is a combinatorial problem, which is given a set of items, each of which has a weight and value. Knapsack solution using Dynamic Programming does not always get optimal results.

Downloads

Download data is not yet available.

References

Amini, A.A., T.E. Weymouth, and R.C. Jain, Using dynamic programming for solving variational problems in vision. IEEE Transactions on pattern analysis and machine intelligence, 1990. 12(9): p. 855-867.DOI: https://doi.org/10.1109/34.57681.

Hifi, M. and N. Otmani, An algorithm for the disjunctively constrained knapsack problem. International Journal of Operational Research, 2012. 13(1): p. 22-43.DOI: https://doi.org/10.1504/IJOR.2012.044026.

Chu, P.C. and J.E. Beasley, A genetic algorithm for the multidimensional knapsack problem.Journal of heuristics, 1998. 4(1): p. 63-86.DOI: https://doi.org/10.1023/A:1009642405419.

Bellman, R., Dynamic programming. Science, 1966. 153(3731): p. 34-37.DOI: https://doi.org/10.1126/science.153.3731.34.

Downloads

Published

2022-01-30

Issue

Vol. 23 No. 1 (2022): CENTRAL ASIA AND THE CAUCASUS

Section

Articles

License

Copyright (c) 2022 Author

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

You are free to:

  1. Share — copy and redistribute the material in any medium or format for any purpose, even commercially.
  2. Adapt — remix, transform, and build upon the material for any purpose, even commercially.
  3. The licensor cannot revoke these freedoms as long as you follow the license terms.

Under the following terms:

  1. Attribution — You must give appropriate credit , provide a link to the license, and indicate if changes were made . You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
  2. No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.

Notices:
You do not have to comply with the license for elements of the material in the public domain or where your use is permitted by an applicable exception or limitation .
No warranties are given. The license may not give you all of the permissions necessary for your intended use. For example, other rights such as publicity, privacy, or moral rights may limit how you use the material.

How to Cite

Violina, S., & Herlistiono, I. O. (2022). Solving Knapsack Problem using Dynamic Programming. CENTRAL ASIA AND THE CAUCASUS, 23(1), 1275-1279. https://ca-c.org/CAC/index.php/cac/article/view/167

Plaudit