The set covering problem: Complexity, algorithms, experiments (Q2713942)
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: The set covering problem: Complexity, algorithms, experiments |
scientific article; zbMATH DE number 1603205
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The set covering problem: Complexity, algorithms, experiments |
scientific article; zbMATH DE number 1603205 |
Statements
10 June 2001
0 references
set covering
0 references
NP-hard
0 references
greedy heuristic
0 references
The set covering problem: Complexity, algorithms, experiments (English)
0 references
The article under review is a survey which deals with the structure and complexity of the set covering problem as well as with algorithms for its solving and results of numerical experiments. The main attention is paid to recent results.
0 references
