SET-COVERING PROBLEM

被引:70
作者
BALAS, E [1 ]
PADBERG, MW [1 ]
机构
[1] CARNEGIE MELLON UNIV,PITTSBURGH,PA 15213
关键词
D O I
10.1287/opre.20.6.1152
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
引用
收藏
页码:1152 / 1161
页数:10
相关论文
共 25 条
[1]  
ANDREW G, 1968, GENERALIZED SET COVE
[2]  
Arabeyre J.P., 1969, TRANSPORTATION SCI, V3, P140, DOI 10.1287/trsc.3.2.140
[3]  
BALAS E, 1972, 295 CARN MELL U MAN
[4]  
BALAS E, 1971, 198R CARN MELL U MAN
[5]   ON INTEGER-PROGRAM FOR DELIVERY PROBLEM [J].
BALINSKI, ML ;
QUANDT, RE .
OPERATIONS RESEARCH, 1964, 12 (02) :300-&
[6]  
BELLMORE M, SET COVERING INVOLUT
[7]   A MODEL FOR THE OPTIMAL PROGRAMMING OF RAILWAY FREIGHT TRAIN MOVEMENTS [J].
CHARNES, A ;
MILLER, MH .
MANAGEMENT SCIENCE, 1956, 3 (01) :74-92
[8]  
Dantzig G.B., 1963, LINEAR PROGRAMMING
[9]  
DANTZIG GB, 1960, MANAGEMENT SCI, V6, P80
[10]  
DANTZIG GB, 1951, ACTIVITY ANALYSIS PR