Continuous-Time Shortest Path Problems and Linear Programming

DOI10.1137/S0363012991196414zbMath0801.90121OpenAlexW2093805145MaRDI QIDQ4291172

Andy B. Philpott

Publication date: 5 May 1994

Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0363012991196414

zbMATH Keywords

shortest pathdualitystrong dualitycontinuous-time linear programextreme point optimal solution

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Linear programming (90C05) Paths and cycles (05C38) Programming in abstract spaces (90C48)

Related Items (7)

Algorithms for a special class of state-dependent shortest path problems with an application to the train routing problem ⋮ Dynamic shortest path problems with time-varying costs ⋮ Continuous and discrete flows over time ⋮ Algorithms for time-dependent bicriteria shortest path problems ⋮ A survey on models and algorithms for discrete evacuation planning network problems ⋮ Computation of the optimal value function in time-dependent networks ⋮ Necessary and sufficient optimality conditions of a design decision on the structure of a local computer network

This page was built for publication: Continuous-Time Shortest Path Problems and Linear Programming