AN EFFICIENT HEURISTIC FOR LARGE SET COVERING PROBLEMS

被引：53

作者：

VASKO, FJ ^{[1
]}

WILSON, GR ^{[1
]}

机构：

[1] LEHIGH UNIV,DEPT IND ENGN,BETHLEHEM,PA 18015

来源：

关键词：

D O I：

10.1002/nav.3800310118

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：163 / 171

页数：9

共 11 条

BAKER, EK .

[2]

BALAS E, 1980, MATH PROGRAM STUD, V12, P37, DOI 10.1007/BFb0120886

[3]

Chvatal V., 1979, Mathematics of Operations Research, V4, P233, DOI 10.1287/moor.4.3.233

[4] DUAL-BASED PROCEDURE FOR UNCAPACITATED FACILITY LOCATION [J].

ERLENKOTTER, D .

[5]

FISHERTIPETT, 1928, P CAMBRIDGE PHIL SOC, V24, P180

[6]

Garfinkel R. S., 1972, INTEGER PROGRAMMING

GOLDEN, BL ;

ALT, FB .

[8] WORST CASE ANALYSIS OF A CLASS OF SET COVERING HEURISTICS [J].

HO, AC .

[9]

Karp R. M., 1972, COMPLEXITY COMPUTER

[10]

MONRO S, 1982, COMMUNICATION JUL