A SHARP BOUND ON THE RATIO BETWEEN OPTIMAL INTEGER AND FRACTIONAL COVERS

被引:3
作者
BALAS, E
机构
关键词
D O I
10.1287/moor.9.1.1
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
引用
收藏
页码:1 / 5
页数:5
相关论文
共 7 条
[1]  
BALAS E, 1980, MATH PROGRAM STUD, V12, P37, DOI 10.1007/BFb0120886
[2]  
BALAS E, 1981, 8113 U KOHN MATH I R
[3]  
Chvatal V., 1979, Mathematics of Operations Research, V4, P233, DOI 10.1287/moor.4.3.233
[4]   WORST CASE ANALYSIS OF A CLASS OF SET COVERING HEURISTICS [J].
HO, AC .
MATHEMATICAL PROGRAMMING, 1982, 23 (02) :170-180
[5]  
HOCHBAUM D, 1980, APPROXIMATION ALGORI
[6]   APPROXIMATION ALGORITHMS FOR COMBINATORIAL PROBLEMS [J].
JOHNSON, DS .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1974, 9 (03) :256-278
[7]  
LOVASZ L, DISCRETE MATH, V13, P383