Efficient 0/1-Multiple-Knapsack Problem Solving by Hybrid DP Transformation and Robust Unbiased Filtering
Sign Up to like & getrecommendations! Published in 2022 at "Algorithms"
DOI: 10.3390/a15100366
Abstract: The multiple knapsack problem (0/1-mKP) is a valuable NP-hard problem involved in many science-and-engineering applications. In current research, there exist two main approaches: 1. the exact algorithms for the optimal solutions (i.e., branch-and-bound, dynamic programming… read more here.
Keywords: problem; optimal solutions; robust unbiased; knapsack ... See more keywords