A novel minimal cut-based algorithm to find all minimal capacity vectors for multi-state flow networks

DOI10.1016/j.ejor.2019.10.030zbMath1431.90040OpenAlexW2982546103WikidataQ126846067 ScholiaQ126846067MaRDI QIDQ2286903

Cheng-Fu Huang, Ding-Hsiang Huang, Yi-Kuei Lin

Publication date: 23 January 2020

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2019.10.030

zbMATH Keywords

minimal cutsreliabilityparallel computing\(d\)-MPmulti-state flow network

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Reliability, availability, maintenance, inspection in operations research (90B25)

Cites Work

• Unnamed Item
• Fast computation of bounds for two-terminal network reliability
• An efficient alternative to the exact evaluation of the quickest path flow network reliability problem
• A dynamic bounding algorithm for approximating multi-state two-terminal reliability
• Computing project makespan distributions: Markovian PERT networks revisited
• Distribution and reliability evaluation of MAX-flow in dynamic multi-state flow networks
• On sequence planning for selective maintenance of multi-state systems under stochastic maintenance durations
• Evaluation of system reliability for a stochastic delivery-flow distribution network with inventory
• Reliability Bounds for Multistate Systems with Multistate Components
• Reliability Evaluation of Multistate Systems with Multistate Components
• Computational Complexity of Network Reliability Analysis: An Overview
• 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
• A simple algorithm for reliability evaluation of a stochastic-flow network with node failure

This page was built for publication: A novel minimal cut-based algorithm to find all minimal capacity vectors for multi-state flow networks