Continuous-time dynamic shortest path problems with negative transit times

DOI10.1137/110821111MaRDI QIDQ2930964zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

dualityextreme pointslinear programmingmeasure theoryshortest path

Mathematics Subject Classification ID

Flows in graphs (05C21) Integration with respect to measures and other set functions (28A25) Existence theories for problems in abstract spaces (49J27) Optimality conditions for problems in abstract spaces (49K27) Programming involving graphs or networks (90C35) Extreme-point and pivoting methods (90C49)

Recommendations

• Continuous-Time Shortest Path Problems and Linear Programming
• Dynamic flows in time-varying networks.
• Dynamic shortest path problems with time-varying costs
• A Study of General Dynamic Network Programs with Arc Time-Delays
• On solving continuous-time dynamic network flows

Cited in

(3)

• 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
• Continuous-Time Shortest Path Problems and Linear Programming

This page was built for publication: Continuous-time dynamic shortest path problems with negative transit times

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2930964)