A Lagrangian-based heuristic for large-scale set covering problems (Q1290617)
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 1294671
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Lagrangian-based heuristic for large-scale set covering problems |
scientific article; zbMATH DE number 1294671 |
Statements
A Lagrangian-based heuristic for large-scale set covering problems (English)
0 references
5 September 1999
0 references
primal-dual Lagrangian
0 references
subgradient algorithms
0 references
0-1 programming
0 references
approximate solutions
0 references
railways
0 references
Italian railways
0 references
Lagrangian-based heuristic
0 references
large-scale set-covering problems
0 references
crew-scheduling
0 references
0 references
0 references
0.8966033458709717
0 references
0.8631889820098877
0 references
0.8432947993278503
0 references
0.8184368014335632
0 references
