Finding the shortest path in stochastic networks

DOI10.1016/J.CAMWA.2007.01.012zbMATH Open1122.90015OpenAlexW2090568667MaRDI QIDQ2459617FDOQ2459617

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

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

zbMATH Keywords

linear programmingrandom variablearc lengthincomplete networkStochastic networksminimum expected length

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (22)

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

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)