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
    Shyam Sundar
    Alok Singh
    Operational Research, 2012, 12 : 345 - 365
  • [42] A rough set method for the unicost set covering problem
    Xu, Qingyuan
    Tan, Anhui
    Lin, Yaojin
    INTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS, 2017, 8 (03) : 781 - 792
  • [43] A generalization of the weighted set covering problem
    Yang, J
    Leung, JYT
    NAVAL RESEARCH LOGISTICS, 2005, 52 (02) : 142 - 149
  • [44] Ant system for the set covering problem
    Silva, RMD
    Ramalho, GL
    2001 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS, VOLS 1-5: E-SYSTEMS AND E-MAN FOR CYBERNETICS IN CYBERSPACE, 2002, : 3129 - 3133
  • [45] A genetic algorithm for the set covering problem
    AlSultan, KS
    Hussain, MF
    Nizami, JS
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1996, 47 (05) : 702 - 709
  • [46] A heuristic method for the set covering problem
    Caprara, A
    Fischetti, M
    Toth, P
    OPERATIONS RESEARCH, 1999, 47 (05) : 730 - 743
  • [47] A hybrid heuristic for the set covering problem
    Sundar, Shyam
    Singh, Alok
    OPERATIONAL RESEARCH, 2012, 12 (03) : 345 - 365
  • [48] The probabilistic set-covering problem
    Beraldi, P
    Ruszczynski, A
    OPERATIONS RESEARCH, 2002, 50 (06) : 956 - 967
  • [49] Set covering problem with conflict constraints
    Saffari, Saeed
    Fathi, Yahya
    COMPUTERS & OPERATIONS RESEARCH, 2022, 143
  • [50] Requiring Connectivity in the Set Covering Problem
    J. Orestes Cerdeira
    Leonor S. Pinto
    Journal of Combinatorial Optimization, 2005, 9 : 35 - 47
12345