SET-COVERING PROBLEM .2. ALGORITHM FOR SET PARTITIONING

被引：38

作者：

BALAS, E

PADBERG, M

机构：

[1] CARNEGIE-MELLON UNIV, PITTSBURGH, PA 15213 USA

[2] INT INST MANAGEMENT, BERLIN, GERMANY

来源：

关键词：

D O I：

10.1287/opre.23.1.74

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：74 / 90

页数：17

共 12 条

[1] SET-COVERING PROBLEM [J].

BALAS, E ;

PADBERG, MW .

[2]

BALAS E, 1972, 298 MAN SCIENC RES R

[3]

Berge C, 1972, MATH PROGRAM, V2, P19, DOI 10.1007/BF01584535

[4]

Chernikova N., 1965, COMP MATH MATH PHYS+, V5, P228

[5]

CHERNIKOVA NV, 1964, USSR COMP MATH MATH, V4, P157

GARFINKEL, RS ;

NEMHAUSER, GL .

[7]

PADBERG M, IIMI735 INT I MAN PR

[8]

Padberg M. W., 1973, Mathematical Programming, V5, P199, DOI 10.1007/BF01580121

[9]

Padberg MW, 1974, MATH PROGRAMMING, V6, P180, DOI [10.1007/BF01580235, DOI 10.1007/BF01580235]

[10]

RUBIN DS, 1972, NEIGHBORING VERTICES