State space partitioning methods for stochastic shortest path problems

DOI<9::AID-NET2>3.0.CO;2-H 10.1002/(SICI)1097-0037(199708)30:1<9::AID-NET2>3.0.CO;2-HzbMath0878.90096OpenAlexW2062014422MaRDI QIDQ4355480

Christos Alexopoulos

Publication date: 18 December 1997

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199708)30:1<9::aid-net2>3.0.co;2-h

zbMATH Keywords

reliabilityMonte Carlo methodsshortest pathsstochastic networks

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Stochastic programming (90C15) Reliability, availability, maintenance, inspection in operations research (90B25)

Related Items (5)

Minimum spanning trees in networks with varying edge weights ⋮ Algebraic methods applied to shortest path and maximum flow problems in stochastic networks ⋮ Comparison of the Exact and Approximate Algorithms in the Random Shortest Path Problem ⋮ The most likely path on series-parallel networks ⋮ UTILIZING DISTRIBUTED LEARNING AUTOMATA TO SOLVE STOCHASTIC SHORTEST PATH PROBLEMS

This page was built for publication: State space partitioning methods for stochastic shortest path problems