A novel node-based sequential implicit enumeration method for finding all \(d\)-MPs in a multistate flow network

DOI10.1016/J.INS.2014.11.007zbMath1360.90055OpenAlexW1967937764MaRDI QIDQ527215

Yeh, Wei-Chang

Publication date: 16 May 2017

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2014.11.007

zbMATH Keywords

network reliability\(d\)-MPimplicit enumeration methodmulti-state flow network

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic network models in operations research (90B10)

Related Items (2)

Routing scheme of a multi-state computer network employing a retransmission mechanism within a time threshold ⋮ A quick inclusion-exclusion technique

Cites Work

• Unnamed Item
• Evaluating the reliability of a novel deterioration-effect multi-state flow network
• A method to evaluate routing policy through \(p\) minimal paths for stochastic case
• A practical bounding algorithm for computing two-terminal reliability based on decomposition technique
• Reliability evaluation of multi-state systems under cost consideration
• Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network
• Maximal Flow Through a Network
• A novel method for the network reliability in terms of capacitated-minimum-paths without knowing minimum-paths in advance
• Graph-Based Algorithms for Boolean Function Manipulation
• 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

This page was built for publication: A novel node-based sequential implicit enumeration method for finding all \(d\)-MPs in a multistate flow network