System reliability for quickest path problems under time threshold and budget

DOI10.1016/J.CAMWA.2010.08.026zbMATH Open1205.68098OpenAlexW2088717497MaRDI QIDQ623173FDOQ623173

Authors: Yi-Kuei Lin 

Publication date: 13 February 2011

Published in: Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2010.08.026

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

zbMATH Keywords

system reliabilityquickest pathbudgettime thresholdstochastic-flow networklower boundary points

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25) Reliability, testing and fault tolerance of networks and computer systems (68M15) Network design and communication in computer systems (68M10)

Cites Work

• Fibonacci heaps and their uses in improved network optimization algorithms
• An algorithm for finding the \(k\) quickest paths in a network
• On the quickest path problem
• Algorithms for the constrained quickest path problem and the enumeration of quickest paths
• Finding the \(k\) quickest simple paths in a network
• An algorithm for the quickest path problem
• Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network
• A label-setting algorithm for finding a quickest path
• An algorithm for ranking quickest simple paths
• The all-pairs quickest path problem
• Reliability Bounds for Multistate Systems with Multistate Components
• The quickest path problem
• On a multicommodity stochastic-flow network with unreliable nodes subject to budget constraint
• Reliability evaluation of a limited-flow network in terms of minimal cutsets
• Distributed algorithms for the quickest path problem
• Minimum time paths in a network with mixed time constraints.
• Reliability Evaluation of Multistate Systems with Multistate Components
• On reliability evaluation of a capacitated‐flow network in terms of minimal pathsets
• Internet packet routing: application of a \(K\)-quickest path algorithm
• Minimum cost-reliability ratio path problem
• Deterministic network optimization: A bibliography

Cited In (7)

• Spare routing problem with \(p\) minimal paths for time-based stochastic flow networks
• Calculation of minimal capacity vectors through \(k\) minimal paths under budget and time constraints
• Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network
• Time version of the shortest path problem in a stochastic-flow network
• A method to evaluate routing policy through \(p\) minimal paths for stochastic case
• On transmission time through \(k\) minimal paths of a capacitated-flow network
• Stochastic flow networks via multiple paths under time threshold and budget constraint

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)