A probabilistic heuristic for a computationally difficult set covering problem (Q1122493)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A probabilistic heuristic for a computationally difficult set covering problem |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A probabilistic heuristic for a computationally difficult set covering problem |
scientific article |
Statements
A probabilistic heuristic for a computationally difficult set covering problem (English)
0 references
1989
0 references
The authors present a probabilistic set covering heuristic based on a greedy approach of Chvatal. Computational tests are discussed with instances of set covering problems that arise from Steiner triple systems by their incidence matrices.
0 references
probabilistic set covering heuristic
0 references
greedy approach
0 references
Steiner triple systems
0 references
incidence matrices
0 references
