An improved algorithm for finding all upper boundary points in a stochastic-flow network
From MaRDI portal
Publication:2289333
DOI10.1016/j.apm.2015.10.004zbMath1452.90085OpenAlexW1769918925MaRDI QIDQ2289333
Majid Forghani-elahabad, Nezam Mahdavi-Amiri
Publication date: 28 January 2020
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2015.10.004
Stochastic network models in operations research (90B15) Reliability, availability, maintenance, inspection in operations research (90B25)
Related Items (4)
Reliability of spare routing via intersectional minimal paths within budget and time constraints by simulation ⋮ Reliability evaluation of a stochastic multimodal transport network under time and budget considerations ⋮ Hybrid flow-shop manufacturing network reliability optimization using genetic algorithm and absorbing Markov chain ⋮ An Improved Vectorization Algorithm to Solve the d-MP Problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Spare routing problem with \(p\) minimal paths for time-based stochastic flow networks
- Bounds for increasing multi-state consecutive \(k\)-out-of-\(r\)-from-\(n\): \(F\) system with equal components probabilities
- Reliability analysis of a warm standby repairable system with priority in use
- Reliability evaluation of multi-state systems under cost consideration
- What Monte Carlo models can do and cannot do efficiently?
- Redundant paths and reliability bounds in gamma networks
- Recent Developments in Computing of System-Reliability
- Computational Complexity of Network Reliability Analysis: An Overview
- The Complexity of Enumeration and Reliability Problems
- Reliability evaluation of a limited-flow network in terms of minimal cutsets
- Benchmarking optimization software with performance profiles.
This page was built for publication: An improved algorithm for finding all upper boundary points in a stochastic-flow network
