A column-generation approach to the multiple knapsack problem with color constraints

In this paper, we study a new problem that we refer to as the multiple knapsack with color constraints (MKCP). Motivated by a real application from the steel industry, the MKCP can be formulated by generalizing the multiple knapsack problem. A real-life instance (called mkc) of this problem class is available through MIPLIB, and a larger instance (mkc7) is downloadable from the COIN site. The focus of this paper is to present improved computational results for the two mentioned instances of this problem using a column-generation approach. We solve mkc to optimality and use Dantzig–Wolfe decomposition for upper bounding the other instance. Solving mkc to optimality took less time than it takes to solve the LP relaxation of the original formulation. The larger instance is solved to near optimality (within 0.5% of optimality) in a fraction of the time required to solve the original relaxed LP.