SET PARTITIONING - SURVEY

被引：242

作者：

BALAS, E

PADBERG, MW

机构：

[1] CARNEGIE MELLON UNIV, GRAD SCH IND ADM, PITTSBURGH, PA 15213 USA

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

来源：

关键词：

D O I：

10.1137/1018115

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

引用

页码：710 / 760

页数：51

共 145 条

[1] AGARD J, 1967, REV FRANCAISE AUTO I, V1, P107
[2] AGARD J, 1966, AGIFORS S KILLARNEY
[3] ANDREW G, 1968, GENERALIZED SET COVE
[4] Arabeyre J.P., 1969, TRANSPORTATION SCI, V3, P140, DOI 10.1287/trsc.3.2.140
[5] ARABEYRE JP, 1966, AGIFORS S KILLARNEY
[6] AN ADDITIVE ALGORITHM FOR SOLVING LINEAR PROGRAMS WITH 0-1 VARIABLES
BALAS, E
[J]. OPERATIONS RESEARCH, 1965, 13 (04) : 517 - &
[7] SET-COVERING PROBLEM .2. ALGORITHM FOR SET PARTITIONING
BALAS, E
PADBERG, M
[J]. OPERATIONS RESEARCH, 1975, 23 (01) : 74 - 90
[8] FACETS OF KNAPSACK POLYTOPE
BALAS, E
[J]. MATHEMATICAL PROGRAMMING, 1975, 8 (02) : 146 - 164
[9] SET-COVERING PROBLEM
BALAS, E
PADBERG, MW
[J]. OPERATIONS RESEARCH, 1972, 20 (06) : 1152 - 1161
[10] BALAS E, 1964, CR HEBD ACAD SCI, V258, P3817