Shortest paths in networks with exponentially distributed arc lengths

DOI10.1002/net.3230160303zbMath0644.90094OpenAlexW2099470650MaRDI QIDQ3787813

Vidyadhar G. Kulkarni

Publication date: 1986

Published in: Networks (Search for Journal in Brave)

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

zbMATH Keywords

directed networkexact computationcontinuous time Markov chainboy and crocodiledistribution of the length of the shortest pathsingle absorbing state

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05)

Related Items (15)

Distribution of Minimal Path Lengths when Edge Lengths are Independent Heterogeneous Exponential Random Variables ⋮ Reliability function of a class of time-dependent systems with standby redundancy ⋮ Minimum spanning trees in networks with varying edge weights ⋮ Network reliability: Heading out on the highway ⋮ Least possible time paths in stochastic, time-varying networks. ⋮ Shortest path network problems with stochastic arc weights ⋮ Finding the shortest path in stochastic networks ⋮ A multi-objective discrete reliability optimization problem for dissimilar-unit standby systems ⋮ Random shortest paths: non-Euclidean instances for metric optimization problems ⋮ Multi-objective reliability optimization for dissimilar-unit cold-standby systems using a genetic algorithm ⋮ Reliability evaluation of multi-component cold-standby redundant systems ⋮ A Monte Carlo Technique with Quasirandom Points for the Stochastic Shortest Path Problem ⋮ The expected length of a shortest path ⋮ Approximating the Stochastic Network by its M Shortest Paths ⋮ Optimal control of service rates and arrivals in Jackson networks

This page was built for publication: Shortest paths in networks with exponentially distributed arc lengths