Dynamic Programming Algorithm using Furniture Industry 0/1 Knapsack Problem

• Published in: 2023 5th International Conference on Cybernetics and Intelligent Systems, ICORIS 2023
• Main Author: Anditta M.; Amartya N.; Warnars L.S.; Warnars H.L.H.S.; Ramadhan A.; Siswanto T.; Mantoro T.; Noordin N.
• Format: Conference paper
• Language: English
• Published: Institute of Electrical and Electronics Engineers Inc. 2023
• Online Access: https://www.scopus.com/inward/record.uri?eid=2-s2.0-85182390627&doi=10.1109%2fICORIS60118.2023.10352182&partnerID=40&md5=b74458187791ad70d326a5527edee1d5

Dynamic programming is a fundamental algorithm that can be found in our daily lives easily. One of the dynamic programming algorithm implementations consists of solving the 0/1 knapsack problem. A 0/1 knapsack problem can be seen from industrial production cost. It is prevalent that a production cost has to be as efficient as possible, but the expectation is to get the proceeds of the products higher. Thus, the dynamic programming algorithm can be implemented to solve the diverse knapsack problem, one of which is the 0/1 knapsack problem, which would be the main focus of this paper. The implementation was implemented using C language. This paper was created as an early implementation algorithm using a Dynamic program algorithm applied to an Automatic Identification System (AIS) dataset. © 2023 IEEE.