An efficient binary spider wasp optimizer for multi‐dimensional knapsack instances: experimental validation and analysis

Today's article comes from the Journal of Big Data. The authors are Abdel‐Basset et al., from Zagazig University, in Egypt. In this paper, they present a new way to solve the Multidimensional Knapsack Problem (MKP).

DOI: 10.1186/s40537-024-01055-9

Book
Book

Members Only

You must be an active Journal Club member to access this content. If you're already a member, click the blue button to login. If you're not a member yet, click the sign-up button to get started.

Login to My Account Sign Up