Some Facets for an Assignment Problem with Side Constraints

Ronny Aboudi and George L. Nemhauser
Additional contact information
Ronny Aboudi: University of Miami, Coral Gables, Florida
George L. Nemhauser: Georgia Institute of Technology, Atlanta, Georgia

Operations Research, 1991, vol. 39, issue 2, 244-250

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 (search for similar items in EconPapers)
Date: 1991
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.39.2.244 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:39:y:1991:i:2:p:244-250

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().