Evaluation of Recoverable-Robust Timetables on Tree Networks

DOI10.1007/978-3-642-10217-2_6zbMath1267.90049OpenAlexW1827600673MaRDI QIDQ3651532

Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra

Publication date: 11 December 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-10217-2_6

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Deterministic scheduling theory in operations research (90B35) Graph algorithms (graph-theoretic aspects) (05C85)

This page was built for publication: Evaluation of Recoverable-Robust Timetables on Tree Networks