Reliability of spare routing via intersectional minimal paths within budget and time constraints by simulation
From MaRDI portal
Publication:2150813
DOI10.1007/s10479-020-03923-yzbMath1490.90292OpenAlexW3123707079MaRDI QIDQ2150813
Chin-Chia Chang, Cheng-Fu Huang, Yi-Kuei Lin
Publication date: 30 June 2022
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-020-03923-y
Programming involving graphs or networks (90C35) Stochastic network models in operations research (90B15) Reliability, availability, maintenance, inspection in operations research (90B25)
Cites Work
- Unnamed Item
- Algorithms for the quickest path problem and the reliable quickest path problem
- Spare routing problem with \(p\) minimal paths for time-based stochastic flow networks
- Two stage design for estimating the reliability of series/parallel systems
- Stochastic flow networks via multiple paths under time threshold and budget constraint
- The quickest 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
- Finding the \(k\) quickest simple paths in a network
- An algorithm for the quickest path problem
- A matheuristic approach for the quickest multicommodity \(k\)-splittable flow problem
- Reliability evaluation and big data analytics architecture for a stochastic flow network with time attribute
- An improved algorithm for finding all upper boundary points in a stochastic-flow network
- The all-pairs quickest path problem
- An exact method for the biobjective shortest path problem for large-scale road networks
- A Monte Carlo Sampling Plan for Estimating Network Reliability
- High-confidence estimation of small s -t reliabilities in directed acyclic networks
- A Comparison of Four Monte Carlo Methods for Estimating the Probability of s-t Connectedness
- Multicriteria path and tree problems: discussion on exact algorithms and applications
- Assessment of spare reliability for multi-state computer networks within tolerable packet unreliability
- Min‐Max quickest path problems
- A simple algorithm for reliability evaluation of a stochastic-flow network with node failure
