Complexity, bounds and dynamic programming algorithms for single track train scheduling
| Year of publication: |
2019
|
|---|---|
| Authors: | Harbering, Jonas ; Ranade, Abhiram ; Schmidt, Marie Elisabeth ; Sinnen, Oliver |
| Published in: |
Operations research for transportation. - New York, NY, USA : Springer. - 2019, p. 479-500
|
| Subject: | Theorie | Theory | Dynamische Optimierung | Dynamic programming | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming |
-
A new fast and accurate heuristic for the automatic scene detection problem
Catanzaro, Daniele, (2021)
-
A note on "algorithms for the Calzedonia workload allocation problem"
Pereira, Jordi, (2022)
-
Legrain, Antoine, (2024)
- More ...
-
Resolving Infeasibilities in Railway Timetabling Instances
Polinder, Gert-Jaap, (2018)
-
Preface: public transport planning in the face of uncertainty
Schmidt, Marie Elisabeth, (2021)
-
Modeling and solving line planning with integrated mode choice
Hartleb, Johann, (2021)
- More ...