Speedup Techniques for the Stochastic on-time Arrival Problem
From MaRDI portal
Publication:2918965
DOI10.4230/OASIcs.ATMOS.2012.83zbMath1247.90062OpenAlexW2111065254MaRDI QIDQ2918965
Sébastien Blandin, Samitha Samaranayake, Alex Bayen
Publication date: 2 October 2012
Full work available at URL: https://doi.org/10.4230/OASIcs.ATMOS.2012.83
Abstract computational complexity for mathematical programming problems (90C60) Transportation, logistics and supply chain management (90B06) Stochastic network models in operations research (90B15) Traffic problems in operations research (90B20)
Related Items (5)
Meeting a deadline: shortest paths on stochastic directed acyclic graphs with information gathering ⋮ Arrival time dependent routing policies in public transport ⋮ Robust routing, its price, and the tradeoff between routing robustness and travel time reliability in road networks ⋮ Algorithms for non-linear and stochastic resource constrained shortest path ⋮ Robust Adaptive Routing Under Uncertainty
This page was built for publication: Speedup Techniques for the Stochastic on-time Arrival Problem
