A practical bounding algorithm for computing two-terminal reliability based on decomposition technique

DOI10.1016/J.CAMWA.2010.09.033MaRDI QIDQ636690zbMATHOpenAlexFDO

Authors Yifeng Niu, Fang-Ming Shao

Publication date 28 August 2011

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.camwa.2010.09.033

zbMATH Keywords

decomposition techniqueMP/MCtwo-terminal reliability

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• A dynamic bounding algorithm for approximating multi-state two-terminal reliability
• Practical sequential bounds for approximating two-terminal reliability
• scientific article; zbMATH DE number 1490110
• Fast computation of bounds for two-terminal network reliability
• Series-Parallel Bounds for the Two-Terminal Reliability Problem
• A Computational Algorithm for Reliability Bounds in Probabilistic Design
• A decomposition method for optimization of large-system reliability

Cites work

• scientific article; zbMATH DE number 1295362 (Why is no real title available?)
• A Reliability Bound for Systems of Maintained, Interdependent Components
• Computational Complexity of Network Reliability Analysis: An Overview
• Lower bounds on two-terminal network reliability
• Practical sequential bounds for approximating two-terminal reliability
• The number of s-dimensional faces in a complex: An analogy between the simplex and the cube

Cited in

(7)

• Efficient enumeration of \(d\)-minimal paths in reliability evaluation of multistate networks
• A quick inclusion-exclusion technique
• A dynamic bounding algorithm for approximating multi-state two-terminal reliability
• Practical sequential bounds for approximating two-terminal reliability
• A novel node-based sequential implicit enumeration method for finding all \(d\)-MPs in a multistate flow network
• Network connectivity entropy and its application on network connectivity reliability
• Fast computation of bounds for two-terminal network reliability

This page was built for publication: A practical bounding algorithm for computing two-terminal reliability based on decomposition technique

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