A Computational Study of Exact Knapsack Separation for the Generalized Assignment Problem
The Generalized Assignment Problem is a well-known NP-hard combinatorial optimization problem which consists of minimizing the assignment costs a set of jobs to a set of machines satisfying capacity constraints. Most of the existing algorithms are based on Branch-and-Price, with lower bounds computed by Dantzig-Wolfe reformulation and column generation. In this paper we propose a … Read more