An algorithm for ranking quickest simple paths
From MaRDI portal
Recommendations
Cites work
- A note on two problems in connexion with graphs
- Algorithms for the quickest path problem and the enumeration of quickest paths
- An algorithm for finding the \(k\) quickest paths in a network
- An algorithm for the quickest path problem
- An efficient algorithm for K shortest simple paths
- Finding the K Shortest Loopless Paths in a Network
- Finding the \(k\) quickest simple paths in a network
- On the quickest path problem
- The quickest path problem
Cited in
(29)- Time version of the shortest path problem in a stochastic-flow network
- A computational improvement for a shortest paths ranking algorithm
- A matheuristic approach for the quickest multicommodity k-splittable flow problem
- The energy-constrained quickest path problem
- Binary-state line assignment optimization to maximize the reliability of an information network under time and budget constraints
- A branch and price algorithm to solve the quickest multicommodity \(k\)-splittable flow problem
- Reliability evaluation of a computer network in cloud computing environment subject to maintenance budget
- Calculation of minimal capacity vectors through \(k\) minimal paths under budget and time constraints
- A comprehensive survey on the quickest path problem
- System reliability assessment through p minimal paths in stochastic case with backup-routing
- Backup reliability of stochastic imperfect-node computer networks subject to packet accuracy rate and time constraints
- Reliability evaluation of a multistate network subject to time constraint under routing policy
- Spare reliability for capacitated computer networks under tolerable error rate and latency considerations
- Estimated and accurate system reliabilities of a maintainable computer network subject to maintenance budget
- Fast and fine quickest path algorithm
- An efficient alternative to the exact evaluation of the quickest path flow network reliability problem
- A simple shortest path algorithm with linear average time
- Estimation of maintenance reliability for a cloud computing network
- Backup reliability assessment within tolerable packet error rate for a multi-state unreliable vertex computer network
- Reliability evaluation subject to assured accuracy rate and time for stochastic unreliable-node computer networks
- Assessment of spare reliability for multi-state computer networks within tolerable packet unreliability
- Spare routing problem with p minimal paths for time-based stochastic flow networks
- Ranking One Million Simple Paths in Road Networks
- A method to evaluate routing policy through \(p\) minimal paths for stochastic case
- System reliability for quickest path problems under time threshold and budget
- Stochastic flow networks via multiple paths under time threshold and budget constraint
- Internet packet routing: application of a K-quickest path algorithm
- Computational experiments with a lazy version of a \(K\) quickest simple path ranking algorithm
- On transmission time through \(k\) minimal paths of a capacitated-flow network
This page was built for publication: An algorithm for ranking quickest simple paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1886854)
