SOME FACETS FOR AN ASSIGNMENT PROBLEM WITH SIDE CONSTRAINTS

• 成果类型: Article
• 署名作者: ABOUDI, R; NEMHAUSER, GL
• 署名单位: University System of Georgia; Georgia Institute of Technology
• 刊物名称: OPERATIONS RESEARCH
• ISSN/ISSBN: 0030-364X
• DOI: 10.1287/opre.39.2.244
• 发表日期: 1991
• 页码: 244-250
• 关键词: NETWORKS GRAPHS; matchings; programming; integer; APPLICATIONS AND CUTTING PLANE ALGORITHMS

摘要

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.