The most likely path on series-parallel networks
Authors:
Abstract
No abstract availableKeywords
This publication has 28 references indexed in Scilit:
- Robust discrete optimization and network flowsMathematical Programming, 2003
- Independent and dependent percolation1999
- State space partitioning methods for stochastic shortest path problemsNetworks, 1997
- Reliability optimization of series-parallel systems using a genetic algorithmIEEE Transactions on Reliability, 1996
- Finding the Minimum-Cost Maximum Flow in a Series-Parallel NetworkJournal of Algorithms, 1993
- Arc Reduction and Path Preference in Stochastic Acyclic NetworksManagement Science, 1991
- Probabilistic shortest path problems with budgetary constraintsComputers & Operations Research, 1989
- Note—An Improved Conditional Monte Carlo Technique for the Stochastic Shortest Path ProblemManagement Science, 1986
- Path Preferences and Optimal Paths in Probabilistic NetworksTransportation Science, 1985
- Conditional Monte Carlo: A Simulation Technique for Stochastic Network AnalysisManagement Science, 1971