Finding and exploring promising search space for The 0-1 Multidimensional Knapsack Problem

Open Webpage

Jitao Xu, Hongbo Li, Minghao Yin

Published: 01 Jan 2024, Last Modified: 21 Jul 2025Appl. Soft Comput. 2024EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: Highlights•We propose an efficient and practical algorithm for solving the 0–1 Multidimensional Knapsack Problem in this paper.•The algorithm takes advantages of Evolutionary Computation and Large Neighborhood Search.•It works well in solving the large and hard 0–1 MKP instances.•We provide new lower bounds (best known results) for 10 large and hard instances from the commonly used benchmark set.