A Greedy Heuristic for the Set-Covering Problem (Q3887227): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1287/moor.4.3.233 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1287/MOOR.4.3.233 / rank | |||
Normal rank | |||
Latest revision as of 23:26, 21 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Greedy Heuristic for the Set-Covering Problem |
scientific article |
Statements
A Greedy Heuristic for the Set-Covering Problem (English)
0 references
1979
0 references
greedy heuristic
0 references
set-covering problem
0 references
binary matrix
0 references
approximate solution
0 references
asymptotic exactness estimation
0 references
