Dynamic Programming Algorithm using Furniture Industry 0/1 Knapsack Problem-Reference-Cited by-同舟云学术

Dynamic Programming Algorithm using Furniture Industry 0/1 Knapsack Problem

Published:2023-10-06 Issue: Volume: Page:
ISSN:
Container-title:2023 5th International Conference on Cybernetics and Intelligent System (ICORIS)
language:
Short-container-title:

Author:

Anditta Mietha¹,Amartya Natashya¹,Warnars Laurens Spits²,Warnars Harco Leslie Hendric Spits³,Ramadhan Arief⁴,Siswanto Teddy⁵,Mantoro Teddy⁶,Noordin Nurulhuda⁷

Affiliation:

1. Bina Nusantara University,School of Computer Science,Computer Science Departement,Jakarta,Indonesia,11530

2. Bina Nusantara University,School of Information Systems,Information Systems Departement,Jakarta,Indonesia,11530

3. Bina Nusantara University,BINUS Graduate Program - Computer Science,Computer Science Departement,Jakarta,Indonesia,11530

4. Telkom University,PJJ Informatika,Bandung,Indonesia,40257

5. Trisakti University,Information Systems Department,Jakarta,Indonesia,11440

6. Sampoerna University,Faculty of Engineering and Technology,Jakarta,Indonesia,12760

7. Universiti Teknologi MARA,School of Computing Sciences College of Computing, Informatics and Mathematics,Selangor,Malaysia

Funder

Ministry of Education

Publisher

IEEE

Link

http://xplorestaging.ieee.org/ielx7/10352108/10352178/10352182.pdf?arnumber=10352182

Reference20 articles.

1. A dynamic programming algorithm for the Knapsack Problem with Setup

2. Comparing between different approaches to solve the 0/1 Knapsack problem;Shaheen;International Journal of Computer Science and Network Security (IJCSNS),2016

3. A proposed solution to knapsack problem using branch & bound technique;Goyal;International J. for Innovation Research Multidisciplinary Field,2016

4. Empirical Dynamic Programming