The global optimal algorithm of reliable path finding problem based on backtracking method
From MaRDI portal
Publication:1992766
DOI10.1155/2017/4586471zbMath1426.90246OpenAlexW2765786618MaRDI QIDQ1992766
Hu Shao, Long Zhang, Liang Shen, Jian Zhao
Publication date: 5 November 2018
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2017/4586471
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06)
Cites Work
- Finding reliable shortest paths in road networks under uncertainty
- Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks
- Stochastic shortest paths with recourse
- Finding the k Shortest Paths
- Stochastic shortest path problems with recourse
- Finding the k shortest simple paths
- Near-shortest and K-shortest simple paths
- Shortest Paths in Probabilistic Graphs
This page was built for publication: The global optimal algorithm of reliable path finding problem based on backtracking method
