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

DOI10.1016/J.EJOR.2019.10.030MaRDI QIDQ2286903zbMATH OpenOpenAlexWikidataFDO

Authors Ding-Hsiang Huang, Cheng-Fu 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

\(d\)-MPminimal cutsmulti-state flow networkparallel computingreliability

Mathematics Subject Classification ID

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

Recommendations

• On reliability evaluation of a capacitated‐flow network in terms of minimal pathsets
• A novel node-based sequential implicit enumeration method for finding all d-MPs in a multistate flow network
• Reliability evaluation of a multicommodity capacitated-flow network in terms of minimal pathsets
• Reliability evaluation of a limited-flow network in terms of minimal cutsets
• A novel method for the network reliability in terms of capacitated-minimum-paths without knowing minimum-paths in advance

Cites work

• A dynamic bounding algorithm for approximating multi-state two-terminal reliability
• A simple algorithm for reliability evaluation of a stochastic-flow network with node failure
• An efficient alternative to the exact evaluation of the quickest path flow network reliability problem
• Computational Complexity of Network Reliability Analysis: An Overview
• Computing project makespan distributions: Markovian PERT networks revisited
• Distribution and reliability evaluation of MAX-flow in dynamic multi-state flow networks
• Evaluation of system reliability for a stochastic delivery-flow distribution network with inventory
• Fast computation of bounds for two-terminal network reliability
• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• On reliability evaluation of a capacitated‐flow network in terms of minimal pathsets
• On sequence planning for selective maintenance of multi-state systems under stochastic maintenance durations
• Reliability Bounds for Multistate Systems with Multistate Components
• Reliability evaluation of a limited-flow network in terms of minimal cutsets
• Reliability Evaluation of Multistate Systems with Multistate Components

Cited in

(5)

• An efficient searching method for minimal path vectors in multi-state networks
• A minimal path-based method for computing multistate network reliability
• A novel node-based sequential implicit enumeration method for finding all d-MPs in a multistate flow network
• An efficient network flow code for finding all minimum cost \(s-t\) cutsets
• Simulation-based system reliability estimation of a multi-state flow network for all possible demand levels

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2286903)