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 条
  • [41] Combining Answer Set Programming and domain heuristics for solving hard industrial problems (Application Paper)
    Dodaro, Carmine
    Gasteiger, Philip
    Leone, Nicola
    Musitsch, Benjamin
    Ricca, Francesco
    Shchekotykhin, Kostyantyn
    THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2016, 16 : 653 - 669
  • [42] COCKTAIL OF HEURISTICS FOR SOLVING HARD PROBLEMS
    Corominas-Subias, Albert
    Garcia-Villoria, Alberto
    Pastor-Moreno, Rafael
    DYNA, 2012, 87 (03): : 275 - 278
  • [43] Solving facility layout problems with a set of geometric hard-constraints using tabu search
    Martins, Valdair Candido
    Barbosa Candido, Marco Antonio
    Coelho, Leandro dos Santos
    APPLIED SOFT COMPUTING TECHNOLOGIES: THE CHALLENGE OF COMPLEXITY, 2006, 34 : 251 - 262
  • [44] Solving 'hard' problems - or dodging them
    不详
    SCIENCE, 1998, 279 (5355) : 1295 - 1295
  • [45] Soft robots solving hard problems
    Brennan, Marshall R.
    DEVICE, 2024, 2 (09):
  • [46] A Binary Cuckoo Search Algorithm for Solving the Set Covering Problem
    Soto, Ricardo
    Crawford, Broderick
    Olivares, Rodrigo
    Barraza, Jorge
    Johnson, Franklin
    Paredes, Fernando
    BIOINSPIRED COMPUTATION IN ARTIFICIAL SYSTEMS, PT II, 2015, 9108 : 88 - 97
  • [47] On a linearization technique for solving the quadratic set covering problem and variations
    Pandey, Pooja
    Punnen, Abraham P.
    OPTIMIZATION LETTERS, 2017, 11 (07) : 1357 - 1370
  • [48] ENUMERATION TECHNIQUE FOR SOLVING THE MULTIOBJECTIVE LINEAR SET COVERING PROBLEM
    SAXENA, RR
    ARORA, SR
    ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 1995, 12 (01) : 87 - 97
  • [49] Solving the Set Covering Problem with a Shuffled Frog Leaping Algorithm
    Crawford, Broderick
    Soto, Ricardo
    Pena, Cristian
    Palma, Wenceslao
    Johnson, Franklin
    Paredes, Fernando
    INTELLIGENT INFORMATION AND DATABASE SYSTEMS, PT II, 2015, 9012 : 41 - 50
  • [50] Solving the Set Covering Problem with the Soccer League Competition Algorithm
    Jaramillo, Adrian
    Crawford, Broderick
    Soto, Ricardo
    Mansilla Villablanca, Sebastian
    Gomez Rubio, Alvaro
    Salas, Juan
    Olguin, Eduardo
    TRENDS IN APPLIED KNOWLEDGE-BASED SYSTEMS AND DATA SCIENCE, 2016, 9799 : 884 - 891
12345