Improved core problem based heuristics for the 0/1 multi‐dimensional knapsack problem

We consider the 0/1 multi‐dimensional knapsack problem and discuss the performances of a new heuristic procedure particularly suitable for a parallel computing environment embedding core problem approaches and a branching scheme based on reduced costs of the corresponding LP relaxation solution value. The proposed approach compared favorably to the recent state of the art procedures available in the literature on the well known OR‐Library multi‐dimensional knapsack problem benchmarks instances.