Zhenfu Zhang1, Haiyan Yin2, Liudong Zuo3, Pan Lai1,*
CMC-Computers, Materials & Continua, Vol.84, No.1, pp. 919-936, 2025, DOI:10.32604/cmc.2025.062980
- 09 June 2025
Abstract The knapsack problem is a classical combinatorial optimization problem widely encountered in areas such as logistics, resource allocation, and portfolio optimization. Traditional methods, including dynamic programming (DP) and greedy algorithms, have been effective in solving small problem instances but often struggle with scalability and efficiency as the problem size increases. DP, for instance, has exponential time complexity and can become computationally prohibitive for large problem instances. On the other hand, greedy algorithms offer faster solutions but may not always yield the optimal results, especially when the problem involves complex constraints or large numbers of items.… More >
Login
Register
