Dynamic Algorithms for Recoverable Robustness Problems.

DOI10.4230/OASIcs.ATMOS.2008.1587zbMath1247.90038OpenAlexW1522412364MaRDI QIDQ2917363

Anita Schöbel, Gabriele Di Stefano, Serafino Cicerone, Michael Schachtebeck

Publication date: 28 September 2012

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2008/1587/pdf/08002.Cicerone.1587.pdf/

zbMATH Keywords

robustnessoptimization problemstimetablingdynamic algorithmsdelay management

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Related Items (4)

Recovery-to-optimality: a new two-stage approach to robustness with an application to aperiodic timetabling ⋮ Nominal and robust train timetabling problems ⋮ Multi-stage recovery robustness for optimization problems: A new concept for planning under disturbances ⋮ A survey on robustness in railway planning

This page was built for publication: Dynamic Algorithms for Recoverable Robustness Problems.