On the Minimum Risk-Sum Path Problem

DOI10.1007/978-3-540-74450-4_16MaRDI QIDQ3611907zbMATH OpenOpenAlexFDO

Authors Jie Hu, Xiaodong Hu, Xujin Chen

Publication date 3 March 2009

Published in Combinatorics, Algorithms, Probabilistic and Experimental Methodologies (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74450-4_16

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Programming involving graphs or networks (90C35)

Recommendations

• Dynamic programming and minimum risk paths
• A new model for path planning with interval data
• The Minimum Risk Spanning Tree Problem
• Least possible time paths in stochastic, time-varying networks.
• Shortest path network problems with stochastic arc weights

Cited in

(10)

• A new model for path planning with interval data
• A polynomial solvable minimum risk spanning tree problem with interval data
• Min-max controllable risk problems
• The risk path selection problem in uncertain network
• Minimizing maximum risk for fair network connection with interval data
• Dynamic programming and minimum risk paths
• Additive consistency of risk measures and its application to risk-averse routing in networks
• Finding a contra-risk path between two nodes in undirected graphs
• Min‐sum controllable risk problems with concave risk functions of the same value range
• Finding an anti-risk path between two nodes in undirected graphs

This page was built for publication: On the Minimum Risk-Sum Path Problem

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