State space partitioning methods for stochastic shortest path problems

DOI10.1002/(SICI)1097-0037(199708)30:1%3C9::AID-NET2%3E3.0.CO;2-HMaRDI QIDQ4355480zbMATH OpenOpenAlexFDO

Authors Christos Alexopoulos

Publication date 18 December 1997

Full work available at URL https://doi.org/10.1002/(sici)1097-0037(199708)30:1%3C9::aid-net2%3E3.0.co;2-h

zbMATH Keywords

Monte Carlo methodsreliabilityshortest pathsstochastic networks

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4053318
• Note—An Improved Conditional Monte Carlo Technique for the Stochastic Shortest Path Problem
• State‐space partition techniques for multiterminal flows in stochastic networks
• Algebraic methods applied to shortest path and maximum flow problems in stochastic networks

Cited in

(7)

• The most likely path on series-parallel networks
• UTILIZING DISTRIBUTED LEARNING AUTOMATA TO SOLVE STOCHASTIC SHORTEST PATH PROBLEMS
• Comparison of the Exact and Approximate Algorithms in the Random Shortest Path Problem
• Note—An Improved Conditional Monte Carlo Technique for the Stochastic Shortest Path Problem
• Algebraic methods applied to shortest path and maximum flow problems in stochastic networks
• State‐space partition techniques for multiterminal flows in stochastic networks
• Minimum spanning trees in networks with varying edge weights

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4355480)