SOLVING HARD SET COVERING PROBLEMS

被引:44
|
作者
MANNINO, C
SASSANO, A
机构
[1] Dipartimento di Informatica e Sistemistica, Università di Roma La Sapienza, 00185 Roma
关键词
INTEGER PROGRAMMING; ALGORITHMS; BRANCH-AND-BOUND; SET COVERING; STEINER TRIPLE SYSTEMS;
D O I
10.1016/0167-6377(95)00034-H
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
We propose a new branch-and-bound algorithm to solve hard instances of set covering problems arising from Steiner triple systems.
引用
收藏
页码:1 / 5
页数:5
相关论文
共 50 条
  • [21] Relation between set covering and set partitioning problems
    Saxena, RR
    Arora, SR
    INDIAN JOURNAL OF PURE & APPLIED MATHEMATICS, 1997, 28 (07): : 865 - 876
  • [22] Allocating costs in set covering problems
    Bergantinos, Gustavo
    Gomez-Rua, Maria
    Llorca, Natividad
    Pulido, Manuel
    Sanchez-Soriano, Joaquin
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2020, 284 (03) : 1074 - 1087
  • [23] ALGORITHM FOR SET-COVERING PROBLEMS
    GONDRAN, M
    LAURIERE, JL
    REVUE FRANCAISE D AUTOMATIQUE INFORMATIQUE RECHERCHE OPERATIONNELLE, 1975, (NV2): : 33 - 51
  • [24] ENHANCING AN ALGORITHM FOR SET COVERING PROBLEMS
    BEASLEY, JE
    JORNSTEN, K
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1992, 58 (02) : 293 - 300
  • [25] ON A CLASS OF PROBLEMS ON COVERING OF A BOUNDED SET
    YAKOVLEV, SV
    ACTA MATHEMATICA HUNGARICA, 1989, 53 (3-4) : 253 - 262
  • [26] A SURROGATE HEURISTIC FOR SET COVERING PROBLEMS
    LORENA, LAN
    LOPES, FB
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1994, 79 (01) : 138 - 150
  • [27] Solving Pre-Processed Set Covering Problems via Cuckoo Search and Levy Flights
    Soto, Ricardo
    Crawford, Broderick
    Barraza, Jorge
    Johnson, Franklin
    Paredes, Fernando
    2015 10TH IBERIAN CONFERENCE ON INFORMATION SYSTEMS AND TECHNOLOGIES (CISTI), 2015,
  • [28] PROBABILISTIC PARTIAL SET COVERING PROBLEMS
    SHERALI, HD
    KIM, SI
    PARRISH, EL
    NAVAL RESEARCH LOGISTICS, 1991, 38 (01) : 41 - 51
  • [29] THE COLUMN SUBTRACTION ALGORITHM - AN EXACT METHOD FOR SOLVING WEIGHTED SET COVERING, PACKING AND PARTITIONING PROBLEMS
    HARCHE, F
    THOMPSON, GL
    COMPUTERS & OPERATIONS RESEARCH, 1994, 21 (06) : 689 - 705
  • [30] A QUASI-MECHANICAL METHOD FOR SOLVING THE RECTANGLE COVERING PROBLEM - AN APPROACH TO TACKLING NP HARD PROBLEMS
    HUANG, WQ
    WANG, GQ
    CVGIP-GRAPHICAL MODELS AND IMAGE PROCESSING, 1994, 56 (03): : 267 - 271