Author of the publication

Robust Recoverable Path Using Backup Nodes.

, , , , and . SOFSEM, volume 9587 of Lecture Notes in Computer Science, page 95-106. Springer, (2016)

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

Path Planning for Groups Using Column Generation., , , and . MIG, volume 6459 of Lecture Notes in Computer Science, page 94-105. Springer, (2010)Separating a walkable environment into layers., , , and . MIG, page 101-106. ACM, (2016)Scheduling Electric Buses with Stochastic Driving Times., , , and . ATMOS, volume 115 of OASIcs, page 14:1-14:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)How to Measure the Robustness of Shunting Plans., , and . ATMOS, volume 65 of OASIcs, page 3:1-3:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)TORS: A Train Unit Shunting and Servicing Simulator., , , , , , and . AAMAS, page 1785-1787. ACM, (2021)Finding Robust Solutions for the Stochastic Job Shop Scheduling Problem by Including Simulation in Local Search., , and . SEA, volume 7933 of Lecture Notes in Computer Science, page 402-413. Springer, (2013)The two-machine open shop problem: To fit or not to fit, that is the question., , and . Oper. Res. Lett., 31 (3): 219-224 (2003)Parallel Machine Scheduling Through Column Generation: Minimax Objective Functions., , and . ESA, volume 4168 of Lecture Notes in Computer Science, page 648-659. Springer, (2006)Minimizing the Number of Tardy Jobs., and . Handbook of Scheduling, Chapman and Hall/CRC, (2004)Getting rid of stochasticity: applicable sometimes., and . Algorithms for Optimization with Incomplete Information, volume 05031 of Dagstuhl Seminar Proceedings, IBFI, Schloss Dagstuhl, Germany, (2005)