Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases
type: Item
instance of: scholarly article
title: Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases
zbMATH Open document ID: 1176.90203
author: Serafino Cicerone
author: Gianlorenzo D'Angelo
author: Daniele Frigioni
author: Alfredo Navarra
author: Gabriele Di Stefano
published in: Journal of Combinatorial Optimization
publication date: 2009-12-02T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 5641554
zbMATH Keywords: timetable optimization
zbMATH Keywords: robust optimization
zbMATH Keywords: recoverable robustness
MaRDI profile type: Publication
full work available at URL: s10878-009-9247-4
OpenAlex ID: W2021221063
cites work: Robust optimization - a comprehensive survey
cites work: The Price of Robustness
cites work: Robust algorithms and price of robustness in shunting problems
cites work: Delay Management Problem: Complexity Results and Robust Algorithms
cites work: Optimization models for the single delay management problem in public transportation
cites work: Q4198056
cites work: Algorithm Theory - SWAT 2004
cites work: Graph-Theoretic Concepts in Computer Science
DOI: 10.1007/S10878-009-9247-4
description: scientific article; zbMATH DE number 5641554