Abstract: Bayesian optimization (BO) is a widely used method for expensive black-box optimization. The BO algorithm can effectively solve low-dimensional problems, but its performance of BO decreases ...
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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback