Approximating the Stochastic Network by its M Shortest Paths

DOI10.1017/S0269964800001297MaRDI QIDQ3415944zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15)

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

Cites work

• Combinatorial optimization. Networks and matroids
• 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”
• Shortest paths in networks with exponentially distributed arc lengths
• Shortest-path algorithms: Taxonomy and annotation

Cited in

(8)

• scientific article; zbMATH DE number 1808552 (Why is no real title available?)
• Extended dominance and a stochastic shortest path problem
• scientific article; zbMATH DE number 3941237 (Why is no real title available?)
• 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
• scientific article; zbMATH DE number 5233923 (Why is no real title available?)
• Approximating the longest path length of a stochastic DAG by a normal distribution in linear time

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)