A Family of Inequalities for the Generalized Assignment Polytope

  • George L. Nemhauser
  • Ismael de Farias
    • Categories 0-1 Programming, Branch and Cut Algorithms Tags , , Short URL: https://optimization-online.org/?p=8497

    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.

    Citation

    Department of Industrial Engineering, State University of New York at Buffalo, under review

    Article

    Download

    View A Family of Inequalities for the Generalized Assignment Polytope