An efficient local search heuristic with row weighting for the unicost set covering problem (Q319859)
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 efficient local search heuristic with row weighting for the unicost set covering problem |
scientific article; zbMATH DE number 6633704
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient local search heuristic with row weighting for the unicost set covering problem |
scientific article; zbMATH DE number 6633704 |
Statements
An efficient local search heuristic with row weighting for the unicost set covering problem (English)
0 references
6 October 2016
0 references
combinatorial optimization
0 references
unicost set covering problem
0 references
row weighting local search
0 references
0 references
