SET COVERING PROBLEM - GROUP THEORETIC APPROACH

被引：0
作者：
THIRIEZ, H
机构：
来源：
REVUE FRANCAISE D AUTOMATIQUE INFORMATIQUE RECHERCHE OPERATIONNELLE | 1971年 / 5卷 / NV3期
关键词：
D O I：
暂无
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
引用
收藏
页码：83 / 103
页数：21
相关论文
共 50 条
  • [41] A hybrid heuristic for the set covering problem
    Sundar, Shyam
    Singh, Alok
    OPERATIONAL RESEARCH, 2012, 12 (03) : 345 - 365
  • [42] The probabilistic set-covering problem
    Beraldi, P
    Ruszczynski, A
    OPERATIONS RESEARCH, 2002, 50 (06) : 956 - 967
  • [43] Approximation of the quadratic set covering problem
    Escoffier, Bruno
    Hammer, Peter L.
    DISCRETE OPTIMIZATION, 2007, 4 (3-4) : 378 - 386
  • [44] A note on the Clustered Set Covering Problem
    Alfandari, Laurent
    Monnot, Jerome
    DISCRETE APPLIED MATHEMATICS, 2014, 164 : 13 - 19
  • [45] A generalization of the weighted set covering problem
    Yang, J
    Leung, JYT
    NAVAL RESEARCH LOGISTICS, 2005, 52 (02) : 142 - 149
  • [46] Requiring Connectivity in the Set Covering Problem
    J. Orestes Cerdeira
    Leonor S. Pinto
    Journal of Combinatorial Optimization, 2005, 9 : 35 - 47
  • [47] Constructive Metaheuristics for the Set Covering Problem
    Crawford, Broderick
    Soto, Ricardo
    Astorga, Gino
    Garcia, Jose
    BIOINSPIRED OPTIMIZATION METHODS AND THEIR APPLICATIONS, BIOMA 2018, 2018, 10835 : 88 - 99
  • [48] Requiring connectivity in the set covering problem
    Cerdeira, JO
    Pinto, LS
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2005, 9 (01) : 35 - 47
  • [49] A rough set method for the unicost set covering problem
    Qingyuan Xu
    Anhui Tan
    Yaojin Lin
    International Journal of Machine Learning and Cybernetics, 2017, 8 : 781 - 792
  • [50] Relaxation heuristics for the set covering problem
    Umetani, Shunji
    Yagiura, Mutsunori
    JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 2007, 50 (04) : 350 - 375
12345