VALID INEQUALITIES AND FACETS OF THE CAPACITATED PLANT LOCATION PROBLEM

被引：52

作者：

LEUNG, JMY ^{[1
]}

MAGNANTI, TL ^{[1
]}

机构：

[1] MIT,ALFRED P SLOAN SCH MANAGEMENT,CAMBRIDGE,MA 02139

来源：

MATHEMATICAL PROGRAMMING | 1989年 / 44卷 / 03期

关键词：

D O I：

10.1007/BF01587093

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：271 / 291

页数：21

共 43 条

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

CROWDER, H ;

JOHNSON, EL ;

PADBERG, M .

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

[12] SOLVING LARGE-SCALE SYMMETRIC TRAVELING SALESMAN PROBLEMS TO OPTIMALITY [J].

CROWDER, H ;

PADBERG, MW .

MANAGEMENT SCIENCE, 1980, 26 (05) :495-509

[13]

DANTZIG GB, 1954, OPER RES, V2, P394

[14]

Dykstra D. P., 1977, AIIE Transactions, V9, P270, DOI 10.1080/05695557708975155

[15] SOLVING MULTI-ITEM CAPACITATED LOT-SIZING PROBLEMS USING VARIABLE REDEFINITION [J].

EPPEN, GD ;

MARTIN, RK .

OPERATIONS RESEARCH, 1987, 35 (06) :832-848

[16] DATABASE LOCATION IN COMPUTER-NETWORKS [J].

FISHER, ML ;

HOCHBAUM, DS .

JOURNAL OF THE ACM, 1980, 27 (04) :718-735

[17] LAGRANGEAN RELAXATION APPLIED TO CAPACITATED FACILITY LOCATION PROBLEMS [J].

GEOFFRION, A ;

MCBRIDE, R .

AIIE TRANSACTIONS, 1978, 10 (01) :40-47

[18] A CUTTING PLANE ALGORITHM FOR THE LINEAR ORDERING PROBLEM [J].

GROTSCHEL, M ;

JUNGER, M ;

REINELT, G .

OPERATIONS RESEARCH, 1984, 32 (06) :1195-1220

[19] FACETS OF THE LINEAR ORDERING POLYTOPE [J].

GROTSCHEL, M ;

JUNGER, M ;

REINELT, G .

MATHEMATICAL PROGRAMMING, 1985, 33 (01) :43-60

[20] THE ELLIPSOID METHOD AND ITS CONSEQUENCES IN COMBINATORIAL OPTIMIZATION [J].

GROTSCHEL, M ;

LOVASZ, L ;

SCHRIJVER, A .

COMBINATORICA, 1981, 1 (02) :169-197

← 1 2 3 4 5 →