Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network
From MaRDI portal
Publication:1870808
DOI10.1016/S0305-0548(02)00025-4zbMath1026.90024OpenAlexW2039033548MaRDI QIDQ1870808
Publication date: 14 May 2003
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(02)00025-4
system reliabilityminimal pathstochastic-flow networktime constraintquickest pathlower boundary point
Stochastic network models in operations research (90B15) Reliability, availability, maintenance, inspection in operations research (90B25)
Related Items (35)
A label-setting algorithm for finding a quickest path ⋮ Reliable and economic resource allocation in an unreliable flow network ⋮ Fast and fine quickest path algorithm ⋮ DECOMPOSITION ALGORITHMS TO COMPUTE THE QUICKEST TIME DISTRIBUTION IN DYNAMIC NETWORKS ⋮ Calculation of minimal capacity vectors through \(k\) minimal paths under budget and time constraints ⋮ A comprehensive survey on the quickest path problem ⋮ ESTIMATED AND ACCURATE SYSTEM RELIABILITIES OF A MAINTAINABLE COMPUTER NETWORK SUBJECT TO MAINTENANCE BUDGET ⋮ Reliability evaluation according to a routing scheme for multi-state computer networks under assured accuracy rate ⋮ An efficient alternative to the exact evaluation of the quickest path flow network reliability problem ⋮ Min‐Max quickest path problems ⋮ Algorithms for the quickest time distribution of dynamic stochastic-flow networks ⋮ Binary-state line assignment optimization to maximize the reliability of an information network under time and budget constraints ⋮ A method to evaluate routing policy through \(p\) minimal paths for stochastic case ⋮ System reliability for quickest path problems under time threshold and budget ⋮ Assessing the reliability and the expected performance of a network under disaster risk ⋮ Stochastic flow networks via multiple paths under time threshold and budget constraint ⋮ Backup reliability assessment within tolerable packet error rate for a multi-state unreliable vertex computer network ⋮ Study on multi-objective optimization of flow allocation in a multi-commodity stochastic-flow network with unreliable nodes ⋮ Dealing with residual energy when transmitting data in energy-constrained capacitated networks ⋮ Distribution and reliability evaluation of MAX-flow in dynamic multi-state flow networks ⋮ A novel node-based sequential implicit enumeration method for finding all \(d\)-MPs in a multistate flow network ⋮ Spare routing problem with \(p\) minimal paths for time-based stochastic flow networks ⋮ On transmission time through \(k\) minimal paths of a capacitated-flow network ⋮ An efficient and robust design optimisation of multi-state flow network for multiple commodities using generalised reliability evaluation algorithm and edge reduction method ⋮ Reliability of a stochastic intermodal logistics network under spoilage and time considerations ⋮ Network reliability for multipath TCP networks with a retransmission mechanism under the time constraint ⋮ System Reliability Assessment throughpMinimal Paths in Stochastic Case with Backup-routing ⋮ Reliability evaluation subject to assured accuracy rate and time for stochastic unreliable-node computer networks ⋮ Time version of the shortest path problem in a stochastic-flow network ⋮ Backup reliability of stochastic imperfect-node computer networks subject to packet accuracy rate and time constraints ⋮ Assessment of spare reliability for multi-state computer networks within tolerable packet unreliability ⋮ Reliability evaluation of a computer network in cloud computing environment subject to maintenance budget ⋮ 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 ⋮ Reliability evaluation and big data analytics architecture for a stochastic flow network with time attribute
Cites Work
- The quickest path problem
- Minimum cost-reliability ratio path problem
- Algorithms for the quickest path problem and the enumeration of quickest paths
- 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
- The all-pairs quickest path problem
- 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
- A simple algorithm for reliability evaluation of a stochastic-flow network with node failure
This page was built for publication: Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network
