An efficient heuristic for large set covering problems (Q3318543)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3848973
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient heuristic for large set covering problems |
scientific article; zbMATH DE number 3848973 |
Statements
An efficient heuristic for large set covering problems (English)
0 references
1984
0 references
combinatorial optimization
0 references
random test problems
0 references
computational experience
0 references
comparison of algorithms
0 references
heuristic algorithm
0 references
large set covering problems
0 references
random selection rule
0 references
0.8526633381843567
0 references
0.843425989151001
0 references
0.8420771360397339
0 references
0.8399261236190796
0 references
