A heuristic algorithm for the set covering problem (Q4645914)
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 7000340
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A heuristic algorithm for the set covering problem |
scientific article; zbMATH DE number 7000340 |
Statements
A heuristic algorithm for the set covering problem (English)
0 references
11 January 2019
0 references
Lagrangian relaxation
0 references
crew schedule
0 references
large scale instance
0 references
subgradient optimization
0 references
Lagrangian multiplier vector
0 references
0 references
0.9383020401000975
0 references
0.9034758806228638
0 references
0.8945471048355103
0 references
