(1,k)-configuration facets for the generalized assignment problem (Q914550)

In a previous paper [ibid., 31-52 (1990; Zbl 0694.90071)] the authors described various classes of valid inequalities for the generalized assignment problem. Continuing this work they derive here a family of facets for the polytope associated to this problem. The facet defining inequalities are based upon multiple knapsack constraints and are derived from (1,k)-configuration inequalities discussed in the paper mentioned above.