Papers by Arzaki Muhamad Fadil
The Knapsack problem is one of the classic problems in optimization theory. This problem involves... more The Knapsack problem is one of the classic problems in optimization theory. This problem involves selecting items to be placed into a container with limited capacity, such that the total value of the items is maximized. In this study, the Dynamic Programming algorithm is applied to divide a large problem into smaller sub-problems, storing the results of each sub-problem to avoid redundant computations. The analysis results demonstrate that this algorithm can provide optimal solutions with high efficiency, although challenges remain in terms of significant memory usage. This study also highlights the importance of algorithm applications in resource management and logistics, offering new insights into further developments in optimization algorithms. Pendahuluan Dalam kehidupan sehari-hari kita sering dihadapkan dengan pengambilan keputusan yang kompleks dan dinamis, membuat pengambilan keputusan yang efisien menjadi sangat penting,
Uploads
Papers by Arzaki Muhamad Fadil