Solving large set covering problems for crew scheduling (Q1367686)
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: Solving large set covering problems for crew scheduling |
scientific article; zbMATH DE number 1069646
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving large set covering problems for crew scheduling |
scientific article; zbMATH DE number 1069646 |
Statements
Solving large set covering problems for crew scheduling (English)
0 references
6 May 1998
0 references
crew scheduling
0 references
Lagrangian relaxation
0 references
set-covering
0 references
optimization
0 references
0 references
0.8966033458709717
0 references
0.8671528100967407
0 references
0.8179293274879456
0 references
