A probabilistic heuristic for a computationally difficult set covering problem (Q1122493): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0167-6377(89)90002-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2028438572 / rank | |||
Normal rank | |||
Revision as of 00:05, 20 March 2024
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
