Optimal allocation of buffer times to increase train schedule robustness (Q1752165)
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 6872186
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal allocation of buffer times to increase train schedule robustness |
scientific article; zbMATH DE number 6872186 |
Statements
Optimal allocation of buffer times to increase train schedule robustness (English)
0 references
24 May 2018
0 references
buffer times
0 references
capacity
0 references
knapsack problem
0 references
timetable robustness
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.7882423400878906
0 references
0.7817577123641968
0 references
0.7601380348205566
0 references
0.7523451447486877
0 references
0.7478607892990112
0 references
