Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases (Q1041435): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:52, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases |
scientific article |
Statements
Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases (English)
0 references
2 December 2009
0 references
timetable optimization
0 references
robust optimization
0 references
recoverable robustness
0 references
