THE SIMPLE PLANT LOCATION PROBLEM - SURVEY AND SYNTHESIS

被引：346

作者：

KRARUP, J ^{[1
]}

PRUZAN, PM ^{[1
]}

机构：

[1] UNIV COPENHAGEN, INST ECON, DK-1455 COPENHAGEN, DENMARK

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1983年 / 12卷 / 01期

关键词：

D O I：

10.1016/0377-2217(83)90181-9

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：36 / 81

页数：46

共 123 条

[1] EFFICIENT BRANCH AND BOUND ALGORITHM FOR CAPACITATED WAREHOUSE LOCATION PROBLEM [J].

AKINC, U ;

KHUMAWALA, BM .

MANAGEMENT SCIENCE, 1977, 23 (06) :585-594

[2]

BABAYEV DA, 1974, MATH PROGRAM, V1, P249

[3]

Baker K. R., 1974, Logistics and Transportation Review, V10, P195

[4] AN ADDITIVE ALGORITHM FOR SOLVING LINEAR PROGRAMS WITH 0-1 VARIABLES [J].

BALAS, E .

OPERATIONS RESEARCH, 1965, 13 (04) :517-&

[5] SET-COVERING PROBLEM .2. ALGORITHM FOR SET PARTITIONING [J].

BALAS, E ;

PADBERG, M .

OPERATIONS RESEARCH, 1975, 23 (01) :74-90

[6] SET-COVERING PROBLEM [J].

BALAS, E ;

PADBERG, MW .

OPERATIONS RESEARCH, 1972, 20 (06) :1152-1161

[7] SET PARTITIONING - SURVEY [J].

BALAS, E ;

PADBERG, MW .

SIAM REVIEW, 1976, 18 (04) :710-760

[8]

BALAS E, 1975, COMBINATORIAL PROGRA, P205

[9]

Balinski M.L., 1969, PROGR OPERATIONS RES, V3, P195

[10] INTEGER PROGRAMMING - METHODS, USES, COMPUTATION [J].

BALINSKI, ML .

MANAGEMENT SCIENCE, 1965, 12 (03) :253-313

← 1 2 3 4 5 6 7 8 9 10 →