Solving hard set covering problems

DOI10.1016/0167-6377(95)00034-HzbMath0857.90093OpenAlexW1971255318MaRDI QIDQ1924619

Antonio Sassano, Carlo Mannino

Publication date: 20 October 1996

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(95)00034-h

zbMATH Keywords

branch-and-bound algorithmset coveringSteiner triple systems

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items (14)

Improved solutions to the Steiner triple covering problem ⋮ Set covering with almost consecutive ones property ⋮ Covering models and optimization techniques for emergency response facility location and planning: a review ⋮ Constraint Orbital Branching ⋮ Russian doll search for the Steiner triple covering problem ⋮ Classification of orthogonal arrays by integer programming ⋮ A biased random-key genetic algorithm for the Steiner triple covering problem ⋮ An efficient mean field approach to the set covering problem ⋮ Solving large Steiner Triple Covering Problems ⋮ Set covering approach for reconstruction of sibling relationships ⋮ Computational experience with general cutting planes for the set covering problem ⋮ The relationship between the unicost set covering problem and the attribute reduction problem in rough set theory ⋮ An adaptive heuristic algorithm for VLSI test vectors selection ⋮ A tabu search approach to the constraint satisfaction problem as a general problem solver

Uses Software

• DIMACS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A probabilistic heuristic for a computationally difficult set covering problem
• An interior point algorithm to solve computationally difficult set covering problems
• Enhancing an algorithm for set covering problems
• An exact algorithm for the maximum stable set problem
• A combinatorial column generation algorithm for the maximum stable set problem
• Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring
• Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
• Finding a Maximum Clique in an Arbitrary Graph
• A note on some computationally difficult set covering problems
• Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
• A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
• Solution of Set-Covering and Set-Partitioning Problems Using Assignment Relaxations
• A branch and bound algorithm for the maximum clique problem

This page was built for publication: Solving hard set covering problems