A Greedy Heuristic for the Set-Covering Problem (Q3887227): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:23, 5 February 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
