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 条
  • [31] A group-theoretic approach to the WSSUS pulse design problem
    Jung, P
    Wunder, G
    2005 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), VOLS 1 AND 2, 2005, : 870 - 874
  • [32] A Group-Theoretic Approach to the Reducibility Problem of Optimal Processes
    K.G. Garaev
    Automation and Remote Control, 2020, 81 : 1167 - 1175
  • [33] Approximation of the quadratic set covering problem
    Escoffier, Bruno
    Hammer, Peter L.
    DISCRETE OPTIMIZATION, 2007, 4 (3-4) : 378 - 386
  • [34] A note on the Clustered Set Covering Problem
    Alfandari, Laurent
    Monnot, Jerome
    DISCRETE APPLIED MATHEMATICS, 2014, 164 : 13 - 19
  • [35] 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
  • [36] ENUMERATIVE TECHNIQUE FOR SET COVERING PROBLEM
    ARORA, SR
    SWARUP, K
    PURI, MC
    NEW ZEALAND OPERATIONAL RESEARCH, 1977, 5 (02): : 119 - 128
  • [37] A genetic algorithm for the set covering problem
    Beasley, JE
    Chu, PC
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 94 (02) : 392 - 404
  • [38] Relaxation heuristics for the set covering problem
    Umetani, Shunji
    Yagiura, Mutsunori
    JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 2007, 50 (04) : 350 - 375
  • [39] Approximation of a geometric set covering problem
    Kovaleva, S
    Spieksma, FCR
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2001, 2223 : 493 - 501
  • [40] ON THE FRACTIONAL SOLUTION TO THE SET COVERING PROBLEM
    HOCHBAUM, DS
    SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1983, 4 (02): : 221 - 222
12345