A Greedy Heuristic for the Set-Covering Problem (Q3887227): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/moor.4.3.233 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2157054705 / rank | |||
Normal rank | |||
Revision as of 00:04, 20 March 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
