Abstract.
We study a generalized assignment problem that arises in production scheduling in which special ordered sets of type II appear naturally in the formulation. We derive three families of facet-defining valid inequalities, and we show that they cut off all infeasible vertices of the LP relaxation. We also give the complete facetial description for a particular case. We then use the inequalities as cuts in a branch-and-cut scheme, and we report computational results that demonstrate the superiority of branch-and-cut over branch-and-bound on this class of problems.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: December 17, 1997 / Accepted: October 21, 1999¶Published online August, 18, 2000
Rights and permissions
About this article
Cite this article
de Farias, Jr., I., Johnson, E. & Nemhauser, G. A generalized assignment problem with special ordered sets: a polyhedral approach. Math. Program. 89, 187–203 (2000). https://doi.org/10.1007/PL00011392
Issue Date:
DOI: https://doi.org/10.1007/PL00011392