Author of the publication

Robust Train Timetabling and Stop Planning with Uncertain Passenger Demand.

, , and . Electron. Notes Discret. Math., (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Nominal and robust train timetabling problems., and . European Journal of Operational Research, 219 (3): 727-737 (2012)A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph., , and . INFORMS J. Comput., 29 (3): 457-473 (2017)Preface., , , and . Electron. Notes Discret. Math., (2018)Solving a Real-World Train Unit Assignment Problem., , and . ATMOS, volume 7 of OASIcs, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, (2007)Recoverable Robustness for Railway Rolling Stock Planning., , , , and . ATMOS, volume 9 of OASIcs, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, (2008)Finding cliques of maximum weight on a generalization of permutation graphs., , and . Optimization Letters, 7 (2): 289-296 (2013)A multistart heuristic for the equality generalized traveling salesman problem., , , and . Networks, 57 (3): 231-239 (2011)An Effective Peak Period Heuristic for Railway Rolling Stock Planning., , and . Transportation Science, 53 (3): 746-762 (2019)Path Optimization for Unmanned Aerial Base Stations with Limited Radio Resources., , , and . PIMRC, page 328-332. IEEE, (2018)Models and Algorithms for Robust Network Design with Several Traffic Scenarios., , , , , , , and . ISCO, volume 7422 of Lecture Notes in Computer Science, page 261-272. Springer, (2012)