EFFICIENT HEURISTIC ALGORITHMS FOR THE WEIGHTED SET COVERING PROBLEM

被引：20
|
作者：
BAKER, EK
机构：
来源：
COMPUTERS & OPERATIONS RESEARCH | 1981年 / 8卷 / 04期
关键词：
D O I：
10.1016/0305-0548(81)90017-4
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
引用
收藏
页码：303 / 310
页数：8
相关论文
共 50 条
  • [1] A NEW EFFICIENT HEURISTIC FOR THE MINIMUM SET COVERING PROBLEM
    AFIF, M
    HIFI, M
    PASCHOS, VT
    ZISSIMOPOULOS, V
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1995, 46 (10) : 1260 - 1268
  • [2] Hybrid heuristic algorithms for set covering
    Monfroglio, A
    COMPUTERS & OPERATIONS RESEARCH, 1998, 25 (06) : 441 - 455
  • [3] What is the best greedy-like heuristic for the weighted set covering problem?
    Vasko, Francis J.
    Lu, Yun
    Zyma, Kenneth
    OPERATIONS RESEARCH LETTERS, 2016, 44 (03) : 366 - 369
  • [4] A hybrid heuristic for the set covering problem
    Shyam Sundar
    Alok Singh
    Operational Research, 2012, 12 : 345 - 365
  • [5] A hybrid heuristic for the set covering problem
    Sundar, Shyam
    Singh, Alok
    OPERATIONAL RESEARCH, 2012, 12 (03) : 345 - 365
  • [6] A heuristic method for the set covering problem
    Caprara, A
    Fischetti, M
    Toth, P
    OPERATIONS RESEARCH, 1999, 47 (05) : 730 - 743
  • [7] Algorithms for the Set Covering Problem
    Alberto Caprara
    Paolo Toth
    Matteo Fischetti
    Annals of Operations Research, 2000, 98 : 353 - 371
  • [8] Algorithms for the set covering problem
    Caprara, A
    Toth, P
    Fischetti, M
    ANNALS OF OPERATIONS RESEARCH, 2000, 98 (1-4) : 353 - 371
  • [9] A generalization of the weighted set covering problem
    Yang, J
    Leung, JYT
    NAVAL RESEARCH LOGISTICS, 2005, 52 (02) : 142 - 149
  • [10] An efficient local search heuristic with row weighting for the unicost set covering problem
    Gao, Chao
    Yao, Xin
    Weise, Thomas
    Li, Jinlong
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2015, 246 (03) : 750 - 761
12345