Solving Knapsack Problem using Dynamic Programming: https://doi.org/10.37178/ca-c.22.1.127

Sriyani Violina; Iwa Ovyawan Herlistiono

Solving Knapsack Problem using Dynamic Programming

https://doi.org/10.37178/ca-c.22.1.127

Authors

Sriyani Violina
Iwa Ovyawan Herlistiono

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

Published

2022-03-02

How to Cite

Sriyani Violina, & Iwa Ovyawan Herlistiono. (2022). Solving Knapsack Problem using Dynamic Programming: https://doi.org/10.37178/ca-c.22.1.127. CENTRAL ASIA AND THE CAUCASUS, 23(1), 1275–1279. Retrieved from https://ca-c.org/submissions/index.php/cac/article/view/206

Download Citation

Issue

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

Section

Articles