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 |
-
Legrain, Antoine, (2024)
-
A new fast and accurate heuristic for the automatic scene detection problem
Catanzaro, Daniele, (2021)
-
Solving multi-agent scheduling problems on parallel machines with a global objective function
Sadi, Faiza, (2014)
- More ...
-
Railway Timetabling With Integrated Passenger Distribution
Hartleb, Johann, (2019)
-
Subline Frequency Setting for Autonomous Minibusses under Demand Uncertainty
Gkiotsalitis, K., (2021)
-
Modeling and Solving Line Planning with Integrated Mode Choice
Hartleb, Johann, (2021)
- More ...