Stochastic shortest path problems with recourse

DOI<133::AID-NET5>3.0.CO;2-L 10.1002/(SICI)1097-0037(199603)27:2<133::AID-NET5>3.0.CO;2-LzbMath0851.90129OpenAlexW2039114216MaRDI QIDQ4887743

George H. Polychronopoulos, John N. Tsitsiklis

Publication date: 5 August 1996

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199603)27:2<133::aid-net5>3.0.co;2-l

zbMATH Keywords

shortest path problemsgraphs with random arc costs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Stochastic programming (90C15) Dynamic programming (90C39)

Related Items (30)

Linear programming formulation for strategic dynamic traffic assignment ⋮ Meeting a deadline: shortest paths on stochastic directed acyclic graphs with information gathering ⋮ Adaptive park-and-ride choice on time-dependent stochastic multimodal transportation network ⋮ Arrival time dependent routing policies in public transport ⋮ Approximation and complexity of multi-target graph search and the Canadian traveler problem ⋮ User equilibrium with recourse ⋮ Finding the most reliable strategy on stochastic and time-dependent transportation networks: a hypergraph based formulation ⋮ The dynamic shortest path problem with anticipation ⋮ Dynamic shortest path problems: hybrid routing policies considering network disruptions ⋮ PH-graphs for analyzing shortest path problems with correlated traveling times ⋮ New reformulations of distributionally robust shortest path problem ⋮ A reliability-based stochastic traffic assignment model for network with multiple user classes under uncertainty in demand ⋮ Complexity of Canadian traveler problem variants ⋮ Joint chance constrained shortest path problem with Copula theory ⋮ Online learning of energy consumption for navigation of electric vehicles ⋮ A new approach to determine the critical path in stochastic activity network ⋮ Maximum probability shortest path problem ⋮ Constrained shortest path with uncertain transit times ⋮ The reset disambiguation policy for navigating stochastic obstacle fields ⋮ Exact algorithms on reliable routing problems under uncertain topology using aggregation techniques for exponentially many scenarios ⋮ The global optimal algorithm of reliable path finding problem based on backtracking method ⋮ Robust path choice in networks with failures ⋮ Dynamic journeying under uncertainty ⋮ Optimal information location for adaptive routing ⋮ Multicriteria adaptive paths in stochastic, time-varying networks ⋮ Efficient, optimal stochastic-action selection when limited by an action budget ⋮ Least expected time paths in stochastic schedule-based transit networks ⋮ Risk-Averse Shortest Path Interdiction ⋮ A directed hypergraph model for random time dependent shortest paths ⋮ UTILIZING DISTRIBUTED LEARNING AUTOMATA TO SOLVE STOCHASTIC SHORTEST PATH PROBLEMS

This page was built for publication: Stochastic shortest path problems with recourse