Shortest paths in stochastic networks with ARC lengths having discrete distributions

DOI10.1002/NET.3230230305MaRDI QIDQ5287451zbMATH OpenOpenAlexFDO

Authors Gehan A. Corea, Vidyadhar G. Kulkarni

Publication date 5 September 1993

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230230305

zbMATH Keywords

computational complexitydiscrete time Markov chainprobability distribution of the shortest path lengthtwo-terminal directed network

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Shortest paths in a lattice network: A comparative study
• Arc Reduction and Path Preference in Stochastic Acyclic Networks
• scientific article; zbMATH DE number 4053318
• Publication:4726020
• Improved sliding shortest path algorithm: performance analysis

Cited in

(8)

• Approximating the longest path length of a stochastic DAG by a normal distribution in linear time
• The shortest-path problem for graphs with random arc-lengths
• Least possible time paths in stochastic, time-varying networks.
• A new approach to determine the critical path in stochastic activity network
• Global optima results for the Kauffman \(NK\) model
• Improved sliding shortest path algorithm: performance analysis
• Shortest paths in a lattice network: A comparative study
• Network reliability: Heading out on the highway

This page was built for publication: Shortest paths in stochastic networks with ARC lengths having discrete distributions

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