Approximating the Stochastic Network by its M Shortest Paths

DOI10.1017/S0269964800001297zbMATH Open1134.90324OpenAlexW2159914335MaRDI QIDQ3415944FDOQ3415944

Authors: Bajis Dodin 

Publication date: 19 January 2007

Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0269964800001297

Recommendations

• A factoring approach for the stochastic shortest path problem
• scientific article; zbMATH DE number 4053318
• Finding the shortest path in stochastic networks
• Algebraic methods applied to shortest path and maximum flow problems in stochastic networks
• Stochastic shortest paths with recourse

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15)

Cites Work

• Shortest-path algorithms: Taxonomy and annotation
• Combinatorial optimization. Networks and matroids
• Shortest paths in networks with exponentially distributed arc lengths
• Deterministic network optimization: A bibliography
• Estimating critical path and arc probabilities in stochastic activity networks
• On Elmaghraby's “The Theory of Networks and Management Science”

Cited In (8)

• Extended dominance and a stochastic shortest path problem
• Title not available (Why is that?)
• Stochastic graphs have short memory: Fully dynamic connectivity in poly-log expected time
• The most likely path on series-parallel networks
• Algebraic methods applied to shortest path and maximum flow problems in stochastic networks
• Title not available (Why is that?)
• Approximating the longest path length of a stochastic DAG by a normal distribution in linear time
• Title not available (Why is that?)

This page was built for publication: Approximating the Stochastic Network by its M Shortest Paths

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