A Relaxation-Based Pruning Technique for a Class of Stochastic Shortest Path Problems

DOI10.1287/trsc.30.3.220zbMath0879.90093OpenAlexW2123784360MaRDI QIDQ4364997

Ishwar Murthy, Sumit Sarkar

Publication date: 1 February 1998

Published in: Transportation Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/trsc.30.3.220

zbMATH Keywords

pruninglabel settingstochastic shortest path problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Stochastic network models in operations research (90B15)

Related Items (14)

Optimal path problems with second-order stochastic dominance constraints ⋮ Shortest paths in stochastic networks with correlated link costs ⋮ New reformulations of distributionally robust shortest path problem ⋮ Algorithms for non-linear and stochastic resource constrained shortest path ⋮ Mean‐standard deviation model for minimum cost flow problem ⋮ A new approach to determine the critical path in stochastic activity network ⋮ New models for shortest path problem with fuzzy arc lengths ⋮ Shortest path network problems with stochastic arc weights ⋮ Maximum probability shortest path problem ⋮ Comparison of the Exact and Approximate Algorithms in the Random Shortest Path Problem ⋮ Extended dominance and a stochastic shortest path problem ⋮ A mean-variance model for the minimum cost flow problem with stochastic arc costs ⋮ Exact algorithms for the stochastic shortest path problem with a decreasing deadline utility function ⋮ Models and algorithm for stochastic shortest path problem

This page was built for publication: A Relaxation-Based Pruning Technique for a Class of Stochastic Shortest Path Problems