Finding the shortest path in stochastic networks

DOI10.1016/J.CAMWA.2007.01.012MaRDI QIDQ2459617zbMATH OpenOpenAlexFDO

Authors S. K. Peer, Dinesh K. Sharma

Publication date 7 November 2007

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.camwa.2007.01.012

zbMATH Keywords

arc lengthincomplete networklinear programmingminimum expected lengthrandom variableStochastic networks

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 4053318
• Shortest paths in networks with exponentially distributed arc lengths
• A factoring approach for the stochastic shortest path problem
• scientific article; zbMATH DE number 4079184
• Minimum Cost Routing on Stochastic Networks

Cites work

• A note on two problems in connexion with graphs
• An Appraisal of Some Shortest-Path Algorithms
• Distribution of the Time Through a Directed, Acyclic Network
• Flow in networks with random capacities
• scientific article; zbMATH DE number 1183297 (Why is no real title available?)
• scientific article; zbMATH DE number 795219 (Why is no real title available?)
• On a routing problem
• On stochastic linear programming. The Laplace transform to the distribution of the optimum and applications
• Shortest path problems with node failures
• Shortest paths in networks with exponentially distributed arc lengths
• Shortest Paths in Probabilistic Graphs
• Shortest paths in stochastic networks with correlated link costs
• The shortest-path problem for graphs with random arc-lengths

Cited in

(23)

• A factoring approach for the stochastic shortest path problem
• Optimal paths in probabilistic networks
• The stochastic problem of synthesizing the shortest connecting network
• On the isometric path partition problem
• Shortest path network problems with stochastic arc weights
• Dynamic journeying under uncertainty
• Finding shortest path in a combined exponential -- gamma probability distribution arc length
• Applying Dijkstra's algorithm for general shortest path problem with normal probability distribution arc length
• The critical node problem in stochastic networks with discrete-time Markov chain
• scientific article; zbMATH DE number 1808552 (Why is no real title available?)
• Distribution of minimal path lengths when edge lengths are independent heterogeneous exponential random variables
• Stochastic scenario-based time-stage optimization model for the least expected time shortest path problem
• Approximating the Stochastic Network by its M Shortest Paths
• Computing shortest paths with uncertainty
• Minimum Cost Routing on Stochastic Networks
• Shortest path through random points
• Technical Note—A Note on the Stochastic Shortest Route Problem
• Shortest paths in networks with exponentially distributed arc lengths
• scientific article; zbMATH DE number 4053318 (Why is no real title available?)
• scientific article; zbMATH DE number 4060972 (Why is no real title available?)
• scientific article; zbMATH DE number 4079184 (Why is no real title available?)
• scientific article; zbMATH DE number 7093019 (Why is no real title available?)
• Stochastic shortest path with unlimited hops

This page was built for publication: Finding the shortest path in stochastic networks

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