Solving hard set covering problems
type: Item
instance of: scholarly article
title: Solving hard set covering problems
zbMATH Open document ID: 0857.90093
DOI: 10.1016/0167-6377(95)00034-H
author: Carlo Mannino
author: Antonio Sassano
published in: Operations Research Letters
publication date: 1996-10-20T00:00:00Z
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 937085
zbMATH Keywords: branch-and-bound algorithm
zbMATH Keywords: set covering
zbMATH Keywords: Steiner triple systems
describes a project that uses: DIMACS
MaRDI profile type: Publication
cites work: A note on some computationally difficult set covering problems
cites work: A branch and bound algorithm for the maximum clique problem
cites work: Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
cites work: Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring
cites work: Finding a Maximum Clique in an Arbitrary Graph
cites work: Enhancing an algorithm for set covering problems
cites work: A combinatorial column generation algorithm for the maximum stable set problem
cites work: Solution of Set-Covering and Set-Partitioning Problems Using Assignment Relaxations
cites work: A probabilistic heuristic for a computationally difficult set covering problem
cites work: Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
cites work: Q4124603
cites work: Q4198056
cites work: Q5592263
cites work: An interior point algorithm to solve computationally difficult set covering problems
cites work: Q5687256
cites work: An exact algorithm for the maximum stable set problem
cites work: A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
full work available at URL: 0167-6377(95)00034-h
OpenAlex ID: W1971255318
description: scientific article; zbMATH DE number 937085