Algebraic methods applied to shortest path and maximum flow problems in stochastic networks
From MaRDI portal
Publication:5326783
DOI10.1002/net.21485zbMath1269.90027OpenAlexW1980573283MaRDI QIDQ5326783
Katherine C. Hastings, Douglas R. Shier
Publication date: 6 August 2013
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.21485
Programming involving graphs or networks (90C35) Symbolic computation and algebraic computation (68W30) Stochastic network models in operations research (90B15) Paths and cycles (05C38) Distance in graphs (05C12)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extended dominance and a stochastic shortest path problem
- A paradigm for listing \((s,t)\)-cuts in graphs
- Bounds on expected performance of networks with links subject to failure
- Technical Note—An Improved Implementation of Conditional Monte Carlo Estimation of Path Lengths in Stochastic Networks
- Bounding the Project Completion Time Distribution in PERT Networks
- The Distribution of Maximum Flow with Applications to Multistate Reliability Systems
- The Stochastic Shortest Route Problem
- Characterizing stochastic flow networks using the monte carlo method
- Maximum flows in probabilistic networks
- Maximum flow in probabilistic graphs-the discrete case
- Bounding distributions for a stochastic pert network
- State space partitioning methods for stochastic shortest path problems
- An Improved Algorithm for Approximating the Performance of Stochastic Flow Networks
- Application of a Technique for Research and Development Program Evaluation
- Expected Critical Path Lengths in PERT Networks
- State‐space partition techniques for multiterminal flows in stochastic networks
- Association of Random Variables, with Applications
- Bounding Distributions for a Stochastic Acyclic Network
This page was built for publication: Algebraic methods applied to shortest path and maximum flow problems in stochastic networks
