Continuous-Time Shortest Path Problems and Linear Programming

DOI10.1137/S0363012991196414MaRDI QIDQ4291172zbMATH OpenOpenAlexFDO

Authors A. 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

continuous-time linear programdualityextreme point optimal solutionshortest pathstrong duality

Mathematics Subject Classification ID

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

Recommendations

• Continuous-time dynamic shortest path problems with negative transit times
• Continuous-time shortest path problems with stopping and starting costs
• Shortest paths in piecewise continuous time-dependent networks
• Dynamic shortest path problems with time-varying costs
• A finite-time algorithm for shortest path problems with time-varying costs

Cited in

(13)

• Continuous-time shortest path problems with stopping and starting costs
• Necessary and sufficient optimality conditions of a design decision on the structure of a local computer network
• Algorithms for a special class of state-dependent shortest path problems with an application to the train routing problem
• A finite-time algorithm for shortest path problems with time-varying costs
• The coolest path problem
• An applicable method for solving the shortest path problems
• 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
• Continuous-time dynamic shortest path problems with negative transit times
• Shortest Paths in Graphs of Convex Sets
• Continuous and discrete flows over time
• Dynamic shortest path problems with time-varying costs

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

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