Continuous-Time Dynamic Shortest Path Problems with Negative Transit Times
From MaRDI portal
Publication:2930964
DOI10.1137/110821111zbMath1331.90089OpenAlexW2049130335MaRDI QIDQ2930964
Ronald Koch, Ebrahim Nasrabadi
Publication date: 21 November 2014
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/110821111
Programming involving graphs or networks (90C35) Integration with respect to measures and other set functions (28A25) Existence theories for problems in abstract spaces (49J27) Extreme-point and pivoting methods (90C49) Optimality conditions for problems in abstract spaces (49K27) Flows in graphs (05C21)
Related Items (2)
Algorithms for a special class of state-dependent shortest path problems with an application to the train routing problem ⋮ Flows over time in time-varying networks: optimality conditions and strong duality
This page was built for publication: Continuous-Time Dynamic Shortest Path Problems with Negative Transit Times
