An algorithm for set covering problem (Q1823139)
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: An algorithm for set covering problem |
scientific article; zbMATH DE number 4114372
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for set covering problem |
scientific article; zbMATH DE number 4114372 |
Statements
An algorithm for set covering problem (English)
0 references
1987
0 references
set covering
0 references
problem reduction tests
0 references
dual ascent
0 references
subgradient optimization
0 references
0 references
0.97027725
0 references
0.9419168
0 references
0.92486954
0 references
0 references
0 references
0.9140468
0 references
0 references
0.9127737
0 references
0.9048141
0 references
