Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases (Q1041435): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10878-009-9247-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2021221063 / rank | |||
Normal rank | |||
Revision as of 20:08, 19 March 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
