Finding the shortest path in stochastic networks

DOI10.1016/j.camwa.2007.01.012zbMath1122.90015OpenAlexW2090568667MaRDI QIDQ2459617

Dinesh Kumar Sharma, S. K. Peer

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

linear programmingarc lengthrandom variableincomplete networkStochastic networksminimum expected length

Mathematics Subject Classification ID

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

Related Items (3)

STOCHASTIC SCENARIO-BASED TIME-STAGE OPTIMIZATION MODEL FOR THE LEAST EXPECTED TIME SHORTEST PATH PROBLEM ⋮ Dynamic journeying under uncertainty ⋮ On the isometric path partition problem

Cites Work

• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• The shortest-path problem for graphs with random arc-lengths
• Shortest paths in stochastic networks with correlated link costs
• On stochastic linear programming. The Laplace transform to the distribution of the optimum and applications
• On a routing problem
• Shortest paths in networks with exponentially distributed arc lengths
• Flow in networks with random capacities
• Shortest path problems with node failures
• Distribution of the Time Through a Directed, Acyclic Network
• An Appraisal of Some Shortest-Path Algorithms
• Shortest Paths in Probabilistic Graphs

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