A graph partitioning strategy for solving large-scale crew scheduling problems (Q2260895)
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: A graph partitioning strategy for solving large-scale crew scheduling problems |
scientific article; zbMATH DE number 6414064
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A graph partitioning strategy for solving large-scale crew scheduling problems |
scientific article; zbMATH DE number 6414064 |
Statements
A graph partitioning strategy for solving large-scale crew scheduling problems (English)
0 references
12 March 2015
0 references
railway operations
0 references
crew scheduling
0 references
large-scale optimization
0 references
graph partitioning
0 references
0 references
0 references
0 references
0 references
0.8714591860771179
0 references
0.7948152422904968
0 references
0.786791980266571
0 references
