A reduce and solve approach for the multiple-choice multidimensional knapsack problem
The MMKP is a difficult combinatorial optimization problem. We use information from linear relaxation to fix some groups and variables. We use an ILP solver (CPLEX) to solve the reduced problem. We use additional strategies to explore the space of the reduced problems. We find improved best lower bounds for 18 out of the 37 benchmark instances.
knapsack linear relaxation fixing heuristics hybridization