System reliability for quickest path problems under time threshold and budget

DOI10.1016/j.camwa.2010.08.026zbMath1205.68098OpenAlexW2088717497MaRDI QIDQ623173

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

zbMATH Keywords

system reliabilitytime thresholdbudgetstochastic-flow networkquickest pathlower boundary points

Mathematics Subject Classification ID

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

Cites Work

• Internet packet routing: application of a \(K\)-quickest path algorithm
• The quickest path problem
• Minimum cost-reliability ratio path problem
• Distributed algorithms for the quickest path problem
• 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
• Minimum time paths in a network with mixed time constraints.
• 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
• On a multicommodity stochastic-flow network with unreliable nodes subject to budget constraint
• Reliability Bounds for Multistate Systems with Multistate Components
• Reliability Evaluation of Multistate Systems with Multistate Components
• Deterministic network optimization: A bibliography
• Reliability evaluation of a limited-flow network in terms of minimal cutsets
• On reliability evaluation of a capacitated‐flow network in terms of minimal pathsets
• Fibonacci heaps and their uses in improved network optimization algorithms

This page was built for publication: System reliability for quickest path problems under time threshold and budget