Topology optimisation of repairable flow networks for a maximum average availability
DOI10.1016/J.CAMWA.2012.02.050zbMATH Open1268.90119OpenAlexW2069454646MaRDI QIDQ356397FDOQ356397
Publication date: 25 July 2013
Published in: Computers & Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2012.02.050
simulationmaximum flowcomplex topologyproduction availabilityrepairable flow networkstopology optimisation
Reliability and life testing (62N05) Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Cites Work
- Title not available (Why is that?)
- Maximal Flow Through a Network
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- A new approach to the maximum-flow problem
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Is Weibull distribution the correct model for predicting probability of failure initiated by non-interacting flaws?
- Reliability Evaluation of a Flow Network
Cited In (1)
This page was built for publication: Topology optimisation of repairable flow networks for a maximum average availability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q356397)