ON THE 0, 1 FACETS OF THE SET COVERING POLYTOPE

被引:29
作者
CORNUEJOLS, G [1 ]
SASSANO, A [1 ]
机构
[1] CNR,IST ANAL SISTEMI & INFORMAT,I-00185 ROMA,ITALY
关键词
D O I
10.1007/BF01582277
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
引用
收藏
页码:45 / 55
页数:11
相关论文
共 20 条
[1]  
BALAS E, 1980, MATH PROGRAM STUD, V12, P19, DOI 10.1007/BFb0120885
[2]  
BALAS E, 1980, MATH PROGRAM STUD, V12, P37, DOI 10.1007/BFb0120886
[3]   SET PARTITIONING - SURVEY [J].
BALAS, E ;
PADBERG, MW .
SIAM REVIEW, 1976, 18 (04) :710-760
[4]  
Balas E., 1977, Mathematics of Operations Research, V2, P15, DOI 10.1287/moor.2.1.15
[5]  
BALAS E, 1984, SOME CLASSES FACETS
[6]  
Balas E., 1986, MSRR522 CARN MELL U
[7]  
BALAS E, 1979, SURVEY MATH PROGRAMM, P393
[8]  
Berge C, 1972, MATH PROGRAM, V2, P19, DOI 10.1007/BF01584535
[9]   ON THE UNCAPACITATED PLANT LOCATION PROBLEM .2. FACETS AND LIFTING THEOREMS [J].
CHO, DC ;
PADBERG, MW ;
RAO, MR .
MATHEMATICS OF OPERATIONS RESEARCH, 1983, 8 (04) :590-612
[10]   CERTAIN POLYTOPES ASSOCIATED WITH GRAPHS [J].
CHVATAL, V .
JOURNAL OF COMBINATORIAL THEORY SERIES B, 1975, 18 (02) :138-154