We present a family of inequalities that are valid for the generalized assignment polytope. Although the inequalities are not facet-defining in general, they define facets of a polytope of a relaxation. We report computational results on the use of the inequalities in a branch-and-cut scheme that demonstrate their effectiveness. (C) 2001 Elsevier Science B.V. All rights reserved.
de Farias, I., & Nemhauser, GL. (2001). A family of inequalities for the generalized assignment polytope. Operations Research Letters, 29(2), 49-55. https://doi.org/10.1016/S0167-6377(01)00086-4 (Original work published 2001)