A factoring approach for the stochastic shortest path problem

DOI10.1016/0167-6377(91)90005-AzbMath0737.90022MaRDI QIDQ1180841

Kelly J. Hayhurst, Douglas R. Shier

Publication date: 27 June 1992

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

PERTtwo-terminal reliabilityacyclic networksdirected stochastic networksshortest path lengthstructural factoring

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Reliability, availability, maintenance, inspection in operations research (90B25) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (1)

Global optima results for the Kauffman \(NK\) model

Cites Work

• Computing the probability distribution of project duration in a PERT network
• Reliability of directed networks using the factoring theorem
• The Complexity of Reliability Computations in Planar and Acyclic Graphs
• Complexity of network reliability computations
• Bounding distributions for a stochastic pert network
• Sequential Bounding of the Reliability of a Stochastic Network
• Expected Critical Path Lengths in PERT Networks
• Distribution of the Time Through a Directed, Acyclic Network
• The Theory of Networks and Management Science. Part I
• Conditional Monte Carlo: A Simulation Technique for Stochastic Network Analysis
• Bounding Distributions for a Stochastic Acyclic Network

This page was built for publication: A factoring approach for the stochastic shortest path problem