System reliability for quickest path problems under time threshold and budget
From MaRDI portal
Publication:623173
Recommendations
- Reliable and restricted quickest path problems
- Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network
- An efficient alternative to the exact evaluation of the quickest path flow network reliability problem
- The constrained reliable shortest path problem in stochastic time-dependent networks
- Algorithms for the quickest path problem and the reliable quickest path problem
- \( \alpha \)-reliable shortest path problem in uncertain time-dependent networks
- The time-dependent quickest path problem: properties and bounds
- Reliability of spare routing via intersectional minimal paths within budget and time constraints by simulation
Cites work
- A label-setting algorithm for finding a quickest path
- Algorithms for the constrained quickest path problem and the enumeration of quickest paths
- An algorithm for finding the \(k\) quickest paths in a network
- An algorithm for ranking quickest simple paths
- An algorithm for the quickest path problem
- Deterministic network optimization: A bibliography
- Distributed algorithms for the quickest path problem
- Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network
- Fibonacci heaps and their uses in improved network optimization algorithms
- Finding the \(k\) quickest simple paths in a network
- Internet packet routing: application of a \(K\)-quickest path algorithm
- Minimum cost-reliability ratio path problem
- Minimum time paths in a network with mixed time constraints.
- On a multicommodity stochastic-flow network with unreliable nodes subject to budget constraint
- On reliability evaluation of a capacitated‐flow network in terms of minimal pathsets
- On the quickest path problem
- Reliability Bounds for Multistate Systems with Multistate Components
- Reliability Evaluation of Multistate Systems with Multistate Components
- Reliability evaluation of a limited-flow network in terms of minimal cutsets
- The all-pairs quickest path problem
- The quickest path problem
Cited in
(13)- 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
- An efficient alternative to the exact evaluation of the quickest path flow network reliability problem
- Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network
- Reliability evaluation subject to assured accuracy rate and time for stochastic unreliable-node computer networks
- On transmission time through \(k\) minimal paths of a capacitated-flow network
- Algorithms for the quickest path problem and the reliable quickest path problem
- Time version of the shortest path problem in a stochastic-flow network
- Calculation of minimal capacity vectors through \(k\) minimal paths under budget and time constraints
- Stochastic flow networks via multiple paths under time threshold and budget constraint
- Reliability of spare routing via intersectional minimal paths within budget and time constraints by simulation
- Spare routing problem with \(p\) minimal paths for time-based stochastic flow networks
- A method to evaluate routing policy through \(p\) minimal paths for stochastic case
This page was built for publication: System reliability for quickest path problems under time threshold and budget
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q623173)
