Extended dominance and a stochastic shortest path problem

DOI10.1016/J.COR.2007.10.016MaRDI QIDQ954058zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 3694968 (Why is no real title available?)
• scientific article; zbMATH DE number 1076783 (Why is no real title available?)
• scientific article; zbMATH DE number 795224 (Why is no real title available?)
• A Relaxation-Based Pruning Technique for a Class of Stochastic Shortest Path Problems
• A computational study of efficient shortest path algorithms
• A label correcting approach for solving bicriterion shortest-path problems
• A parametric approach to solving bicriterion shortest path problems
• An empirical investigation of some bicriterion shortest path algorithms
• Arc Reduction and Path Preference in Stochastic Acyclic Networks
• Expected Critical Path Lengths in PERT Networks
• Markov and Markov-Regenerative <scp>pert</scp> Networks
• Network flows. Theory, algorithms, and applications.
• Optimal paths in graphs with stochastic or multidimensional weights
• Optimal paths in probabilistic networks: A case with temporary preferences
• 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
• Maximum probability shortest path problem
• New reformulations of distributionally robust shortest path problem
• Multi-objective and multi-constrained non-additive shortest path problems
• Mean‐standard deviation model for minimum cost flow problem
• Algebraic methods applied to shortest path and maximum flow problems in stochastic networks
• A mean-variance model for the minimum cost flow problem with stochastic arc costs
• Distributionally robust maximum probability shortest path problem
• Stochastic scenario-based time-stage optimization model for the least expected time shortest path problem
• Finding reliable shortest paths in road networks under uncertainty
• Optimal path problems with second-order stochastic dominance constraints

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)