ON THE UNCAPACITATED PLANT LOCATION PROBLEM .1. VALID INEQUALITIES AND FACETS

被引：56

作者：

CHO, DC

JOHNSON, EL

PADBERG, M

RAO, MR

机构：

[1] IBM CORP,THOMAS J WATSON RES CTR,YORKTOWN HTS,NY 10598

[2] NYU,GRAD SCH BUSINESS ADM,NEW YORK,NY 10006

[3] INDIAN INST MANAGEMENT,BANGALORE,INDIA

来源：

MATHEMATICS OF OPERATIONS RESEARCH | 1983年 / 8卷 / 04期

关键词：

OPERATIONS RESEARCH;

D O I：

10.1287/moor.8.4.579

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

The uncapacitated plant location problem is considered as a node-packing problem. For this problem, several valid inequalities and facets are discussed. Necessary and sufficient conditions for trivial facets along with necessary conditions for nontrivial facets are derived. In addition, all of the facets for the case of three plants and three or more destinations are identified.

引用

页码：579 / 589

页数：11

共 26 条

[1] SET PARTITIONING - SURVEY
BALAS, E
PADBERG, MW
[J]. SIAM REVIEW, 1976, 18 (04) : 710 - 760
[2] Balas E., 1977, Mathematics of Operations Research, V2, P15, DOI 10.1287/moor.2.1.15
[3] ON THE UNCAPACITATED PLANT LOCATION PROBLEM .2. FACETS AND LIFTING THEOREMS
CHO, DC
PADBERG, MW
RAO, MR
[J]. MATHEMATICS OF OPERATIONS RESEARCH, 1983, 8 (04) : 590 - 612
[4] CERTAIN POLYTOPES ASSOCIATED WITH GRAPHS
CHVATAL, V
[J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1975, 18 (02) : 138 - 154
[5] Cornuejols G., 1977, ANN DISCRETE MATH, V1, P163, DOI DOI 10.1016/S0167-5060(08)70732-5
[6] CORNUEJOLS G, 1979, UNPUB MATH PROGRAMMI
[7] SOLVING LARGE-SCALE SYMMETRIC TRAVELING SALESMAN PROBLEMS TO OPTIMALITY
CROWDER, H
PADBERG, MW
[J]. MANAGEMENT SCIENCE, 1980, 26 (05) : 495 - 509
[8] CROWDER HP, 1981, UNPUB OPER RES
[9] COVERS AND PACKINGS IN A FAMILY OF SETS
EDMONDS, J
[J]. BULLETIN OF THE AMERICAN MATHEMATICAL SOCIETY, 1962, 68 (05) : 494 - &
[10] A BRANCH-BOUND ALGORITHM FOR PLANT LOCATION
EFROYMSON, MA
RAY, TL
[J]. OPERATIONS RESEARCH, 1966, 14 (03) : 361 - +

← 1 2 3 →