SOLVING HARD SET COVERING PROBLEMS

被引：44
|
作者：
MANNINO, C
SASSANO, A
机构：
[1] Dipartimento di Informatica e Sistemistica, Università di Roma La Sapienza, 00185 Roma
来源：
OPERATIONS RESEARCH LETTERS | 1995年 / 18卷 / 01期
关键词：
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 条
  • [31] A Black Hole Algorithm for Solving the Set Covering Problem
    Soto, Ricardo
    Crawford, Broderick
    Figueroa, Ignacio
    Niklander, Stefanie
    Olguin, Eduardo
    TRENDS IN APPLIED KNOWLEDGE-BASED SYSTEMS AND DATA SCIENCE, 2016, 9799 : 855 - 861
  • [32] A black hole algorithm for solving the set covering problem
    Soto, Ricardo (ricardo.soto@ucv.cl), 1600, Springer Verlag (9799):
  • [33] Solving large Steiner Triple Covering Problems
    Ostrowski, James
    Linderoth, Jeff
    Rossi, Fabrizio
    Smriglio, Stefano
    OPERATIONS RESEARCH LETTERS, 2011, 39 (02) : 127 - 131
  • [34] Solving geometric covering problems by data reduction
    Mecke, S
    Wagner, D
    ALGORITHMS ESA 2004, PROCEEDINGS, 2004, 3221 : 760 - 771
  • [35] Solving the Set Equilibrium Problems
    Lin, Yen-Cherng
    Chen, Hsin-Jung
    FIXED POINT THEORY AND APPLICATIONS, 2011,
  • [36] Solving the Set Equilibrium Problems
    Yen-Cherng Lin
    Hsin-Jung Chen
    Fixed Point Theory and Applications, 2011
  • [37] An indirect genetic algorithm for set covering problems
    Aickelin, U
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2002, 53 (10) : 1118 - 1126
  • [38] Dynamical covering problems on the triadic Cantor set
    Wang, Bao-Wei
    Wu, Jun
    Xu, Jian
    COMPTES RENDUS MATHEMATIQUE, 2017, 355 (07) : 738 - 743
  • [39] A LAGRANGIAN HEURISTIC FOR SET-COVERING PROBLEMS
    BEASLEY, JE
    NAVAL RESEARCH LOGISTICS, 1990, 37 (01) : 151 - 164
  • [40] AN EFFICIENT HEURISTIC FOR LARGE SET COVERING PROBLEMS
    VASKO, FJ
    WILSON, GR
    NAVAL RESEARCH LOGISTICS, 1984, 31 (01) : 163 - 171
12345