Some Facets for an Assignment Problem with Side Constraints
Ronny Aboudi, George L. Nemhauser
Operations Research · 1991 · Volume 39 · Issue 2
Abstract
This paper presents a class of facet-defining inequalities for an assignment problem with the additional constraints that specified variables are required to be equal to each other. In a special case, the complete polyhedral description is given.
Keywords
networks/graphs: matchings, programming, integer: applications and cutting plane algorithms
Enable JavaScript for citation tools and additional paper interactions.