Extended dominance and a stochastic shortest path problem

DOI10.1016/J.COR.2007.10.016zbMATH Open1163.90391OpenAlexW2030321354MaRDI QIDQ954058FDOQ954058

Authors: Kevin R. Hutson, Douglas R. Shier 

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

Recommendations

• scientific article; zbMATH DE number 4053318
• scientific article; zbMATH DE number 4079184
• Approximating the Stochastic Network by its M Shortest Paths
• A factoring approach for the stochastic shortest path problem
• Models and algorithm for stochastic shortest path problem

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)

Cites Work

• Network flows. Theory, algorithms, and applications.
• 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
• Title not available (Why is that?)
• A Relaxation-Based Pruning Technique for a Class of Stochastic Shortest Path Problems
• Arc Reduction and Path Preference in Stochastic Acyclic Networks
• Title not available (Why is that?)
• Expected Critical Path Lengths in PERT Networks
• Title not available (Why is that?)
• Markov and Markov-Regenerative <scp>pert</scp> Networks
• 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

Cited In (11)

• Minimum costs paths in intermodal transportation networks with stochastic travel times and overbookings
• A mean-variance model for the minimum cost flow problem with stochastic arc costs
• Finding reliable shortest paths in road networks under uncertainty
• Optimal path problems with second-order stochastic dominance constraints
• Multi-objective and multi-constrained non-additive shortest path problems
• Algebraic methods applied to shortest path and maximum flow problems in stochastic networks
• Mean‐standard deviation model for minimum cost flow problem
• New reformulations of distributionally robust shortest path problem
• Maximum probability shortest path problem
• Distributionally robust maximum probability shortest path problem
• Stochastic scenario-based time-stage optimization model for the least expected time shortest path problem

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

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