Shortest paths in stochastic networks with ARC lengths having discrete distributions

DOI10.1002/net.3230230305zbMath0788.90029OpenAlexW1976096628MaRDI QIDQ5287451

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

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

Related Items (4)

Network reliability: Heading out on the highway ⋮ 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

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