Abstract: The 0-1 Knapsack Problem (KP) and Bin Packing Problem (BPP) are NP-hard combinatorial optimization challenges often tackled using metaheuristics. Both problems have prominent utilization in ...
Abstract: The multidimensional knapsack problem (MKP) is a well-known combinatorial optimization problem with many real-life applications. In this article, a memetic algorithm based on probability ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback