Code implementation, memory usage analysis, and execution time analysis for the Unbounded Knapsack Analysis problem using Branch and Bound and Dynamic Programming
Made as an assignment for the Data Analysis and Algorithms class at the Faculty of Computer Science, University of Indonesia.
- Run DatasetGeneration.java to created new datasets
- Run Main.java to see the output and statistics!
Y-J Seong, Y-G G, M-K Kang & C-W Kang (2004) An improved branch and bound algorithm for a strongly correlated unbounded knapsack problem, Journal of the Operational Research Society, 55:5, 547-552, DOI: 10.1057/palgrave.jors.2601698
© [2023] [Daffa Muhammad Faizan]