On the online shortest path problem with limited arc cost dependencies
From MaRDI portal
Publication:4798194
DOI10.1002/net.10049zbMath1026.90088OpenAlexW2081730757MaRDI QIDQ4798194
No author found.
Publication date: 19 March 2003
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.10049
Programming involving graphs or networks (90C35) Stochastic programming (90C15) Deterministic scheduling theory in operations research (90B35)
Related Items (22)
Finding reliable shortest paths in road networks under uncertainty ⋮ Linear programming formulation for strategic dynamic traffic assignment ⋮ Adaptive park-and-ride choice on time-dependent stochastic multimodal transportation network ⋮ User equilibrium with recourse ⋮ Multicriteria stochastic shortest path problem for electric vehicles ⋮ The dynamic shortest path problem with anticipation ⋮ Shortest paths in stochastic networks with correlated link costs ⋮ Dynamic shortest path problems: hybrid routing policies considering network disruptions ⋮ Optimal routing for maximizing the travel time reliability ⋮ Dynamic journeying under uncertainty ⋮ Range-constrained traffic assignment with multi-modal recharge for electric vehicles ⋮ Optimal information location for adaptive routing ⋮ Multicriteria adaptive paths in stochastic, time-varying networks ⋮ Stochastic shortest path with unlimited hops ⋮ Minimizing maximum risk for fair network connection with interval data ⋮ Arriving on time ⋮ Least expected time paths in stochastic schedule-based transit networks ⋮ A new model for path planning with interval data ⋮ An extension of labeling techniques for finding shortest path trees ⋮ Risk-Averse Shortest Path Interdiction ⋮ UTILIZING DISTRIBUTED LEARNING AUTOMATA TO SOLVE STOCHASTIC SHORTEST PATH PROBLEMS ⋮ Optimal decisions in stochastic graphs with uncorrelated and correlated edge weights
This page was built for publication: On the online shortest path problem with limited arc cost dependencies
