Stochastic shortest paths with recourse
From MaRDI portal
Publication:3809600
DOI10.1002/net.3230180306zbMath0659.90085MaRDI QIDQ3809600
Luciano Romeo, Giovanni Andreatta
Publication date: 1988
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230180306
90C35: Programming involving graphs or networks
90C15: Stochastic programming
68R10: Graph theory (including graph drawing) in computer science
90B15: Stochastic network models in operations research
05C20: Directed graphs (digraphs), tournaments
Related Items
Robust path choice in networks with failures, Efficient, optimal stochastic-action selection when limited by an action budget, Linear programming formulation for strategic dynamic traffic assignment, PH-graphs for analyzing shortest path problems with correlated traveling times, Optimal information location for adaptive routing, Discussion of ``Network routing in a dynamic environment, User equilibrium with recourse, The global optimal algorithm of reliable path finding problem based on backtracking method, Adaptive park-and-ride choice on time-dependent stochastic multimodal transportation network, A Mean-Risk Model for the Traffic Assignment Problem with Stochastic Travel Times, The reset disambiguation policy for navigating stochastic obstacle fields
Cites Work