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

共 10 条

[1]

ABOUDI R, 1990, EC DECISION MAKING G

[2]

ABOUDI R, 1986, THESIS CORNELL U ITH

[3] A LAGRANGEAN-RELAXATION METHOD FOR THE CONSTRAINED ASSIGNMENT PROBLEM [J].

AGGARWAL, V .

COMPUTERS & OPERATIONS RESEARCH, 1985, 12 (01) :97-106

[4]

BACHEM A, 1982, MODERN APPLIED MATH, P51

[5] SOLVING LARGE-SCALE ZERO-ONE LINEAR-PROGRAMMING PROBLEMS [J].

CROWDER, H ;

JOHNSON, EL ;

PADBERG, M .

OPERATIONS RESEARCH, 1983, 31 (05) :803-834

[6]

Fulkerson D., 1971, MATH PROGRAM, V1, P168

[7]

GROTSCHEL M, 1985, TRAVELING SALESMAN P, P307

[8] RESOURCE-CONSTRAINED ASSIGNMENT SCHEDULING [J].

MAZZOLA, JB ;

NEEBE, AW .

OPERATIONS RESEARCH, 1986, 34 (04) :560-572

[9]

Nemhauser G. L., 1988, INTEGER COMBINATORIA

[10]

PADBERG M, 1984, MATCHING BONDS, V1

← 1 →