SOME FACETS FOR AN ASSIGNMENT PROBLEM WITH SIDE CONSTRAINTS

被引：10
|
作者：
ABOUDI, R [1 ]
NEMHAUSER, GL [1 ]
机构：
[1] GEORGIA INST TECHNOL,SCH IND & SYST ENGN,ATLANTA,GA 30332
来源：
OPERATIONS RESEARCH | 1991年 / 39卷 / 02期
关键词：
NETWORKS GRAPHS; MATCHINGS; PROGRAMMING; INTEGER; APPLICATIONS AND CUTTING PLANE ALGORITHMS;
D O I：
10.1287/opre.39.2.244
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
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.
引用
收藏
页码：244 / 250
页数：7
相关论文
共 50 条
12345