A NETWORK RELAXATION BASED ENUMERATION ALGORITHM FOR SET PARTITIONING

被引：14

作者：

ALI, AI ^{[1
]}

THIAGARAJAN, H ^{[1
]}

机构：

[1] REG ENGN COLL, TIRUCHI, INDIA

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1989年 / 38卷 / 01期

关键词：

D O I：

10.1016/0377-2217(89)90471-2

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：76 / 85

页数：10

共 18 条

[1]

ALI AI, 1986, 868734 U TEX DEP GEN

[2]

ALI AI, 1986, 858634 U TEX DEP GEN

[3] A NOTE ON SOME COMPUTATIONALLY DIFFICULT SET COVERING PROBLEMS [J].

AVIS, D .

MATHEMATICAL PROGRAMMING, 1980, 18 (02) :138-145

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

BALAS, E ;

PADBERG, M .

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

[5] SET-COVERING PROBLEM [J].

BALAS, E ;

PADBERG, MW .

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

[6]

Balas E., 1979, Combinatorial optimization, P151

[7]

Bartholdi J. J. III, 1982, Operations Research Letters, V1, P190, DOI 10.1016/0167-6377(82)90038-4

[8] EXTRACTING EMBEDDED GENERALIZED NETWORKS FROM LINEAR-PROGRAMMING PROBLEMS [J].

BROWN, GG ;

MCBRIDE, RD ;

WOOD, RK .

MATHEMATICAL PROGRAMMING, 1985, 32 (01) :11-31

[9] AUTOMATIC IDENTIFICATION OF GENERALIZED UPPER-BOUNDS IN LARGE-SCALE OPTIMIZATION MODELS [J].

BROWN, GG ;

THOMEN, DS .

MANAGEMENT SCIENCE, 1980, 26 (11) :1166-1184

[10] AUTOMATIC IDENTIFICATION OF EMBEDDED NETWORK ROWS IN LARGE-SCALE OPTIMIZATION MODELS [J].

BROWN, GG ;

WRIGHT, WG .

MATHEMATICAL PROGRAMMING, 1984, 29 (01) :41-56

← 1 2 →