A probabilistic heuristic for a computationally difficult set covering problem

An efficient probabilistic set covering heuristic is presented. The heuristic is evaluated on empirically difficult to solve set covering problems that arise from Steiner triple systems. The optimal solution to only a few of these instances is known. The heuristic provides these solutions as well as...

Full description

Saved in:
Bibliographic Details
Published in:Operations research letters 1989, Vol.8 (2), p.67-71
Main Authors: Feo, Thomas A, Resende, Mauricio G.C
Format: Article
Language:English
Subjects:
algorithms
Applied sciences
Exact sciences and technology
heuristic
integer programming
Mathematical programming
Operational research and scientific management
Operational research. Management science
set covering
tests
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:An efficient probabilistic set covering heuristic is presented. The heuristic is evaluated on empirically difficult to solve set covering problems that arise from Steiner triple systems. The optimal solution to only a few of these instances is known. The heuristic provides these solutions as well as the best known solutions to all other instances attempted.
ISSN:0167-6377
1872-7468
DOI:10.1016/0167-6377(89)90002-3