Stochastic shortest paths with recourse

DOI10.1002/net.3230180306zbMath0659.90085OpenAlexW2057742448MaRDI 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

zbMATH Keywords

shortest expected lengthstochastic and deterministic shortest pathsstochastic directed network

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Stochastic programming (90C15) Graph theory (including graph drawing) in computer science (68R10) Stochastic network models in operations research (90B15) Directed graphs (digraphs), tournaments (05C20)

Related Items (12)

Linear programming formulation for strategic dynamic traffic assignment ⋮ Adaptive park-and-ride choice on time-dependent stochastic multimodal transportation network ⋮ User equilibrium with recourse ⋮ PH-graphs for analyzing shortest path problems with correlated traveling times ⋮ Network reliability: Heading out on the highway ⋮ Discussion of ``Network routing in a dynamic environment ⋮ The reset disambiguation policy for navigating stochastic obstacle fields ⋮ The global optimal algorithm of reliable path finding problem based on backtracking method ⋮ Robust path choice in networks with failures ⋮ Optimal information location for adaptive routing ⋮ Efficient, optimal stochastic-action selection when limited by an action budget ⋮ A Mean-Risk Model for the Traffic Assignment Problem with Stochastic Travel Times

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: Stochastic shortest paths with recourse