Extended dominance and a stochastic shortest path problem

DOI10.1016/j.cor.2007.10.016zbMath1163.90391OpenAlexW2030321354MaRDI QIDQ954058

Douglas R. Shier, Kevin R. Hutson

Publication date: 7 November 2008

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2007.10.016

zbMATH Keywords

efficiencyPareto optimalitydominancestochastic shortest pathslabeling algorithmsbicriterion shortest paths

Mathematics Subject Classification ID

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

Related Items (10)

Finding reliable shortest paths in road networks under uncertainty ⋮ New reformulations of distributionally robust shortest path problem ⋮ STOCHASTIC SCENARIO-BASED TIME-STAGE OPTIMIZATION MODEL FOR THE LEAST EXPECTED TIME SHORTEST PATH PROBLEM ⋮ Algebraic methods applied to shortest path and maximum flow problems in stochastic networks ⋮ Multi-objective and multi-constrained non-additive shortest path problems ⋮ Minimum costs paths in intermodal transportation networks with stochastic travel times and overbookings ⋮ Mean‐standard deviation model for minimum cost flow problem ⋮ Maximum probability shortest path problem ⋮ A mean-variance model for the minimum cost flow problem with stochastic arc costs ⋮ Distributionally robust maximum probability shortest path problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A parametric approach to solving bicriterion shortest path problems
• Optimal paths in probabilistic networks: A case with temporary preferences
• A computational study of efficient shortest path algorithms
• Shortest path algorithms: A computational study with the C programming language
• An empirical investigation of some bicriterion shortest path algorithms
• A label correcting approach for solving bicriterion shortest-path problems
• Optimal paths in graphs with stochastic or multidimensional weights
• A Relaxation-Based Pruning Technique for a Class of Stochastic Shortest Path Problems
• Markov and Markov-Regenerative <scp>pert</scp> Networks
• Arc Reduction and Path Preference in Stochastic Acyclic Networks
• Expected Critical Path Lengths in PERT Networks

This page was built for publication: Extended dominance and a stochastic shortest path problem