An enumeration algorithm for combinatorial problems of the reliability analysis of binary coherent systems

DOI10.1080/02331938808843400MaRDI QIDQ3820604zbMATH OpenOpenAlexFDO

Authors F. Zettwitz

Publication date 1988

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331938808843400

zbMATH Keywords

backtrack algorithmenumerationreliability of networks

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Reliability and life testing (62N05)

Recommendations

• scientific article; zbMATH DE number 4053686
• Computational Complexity of Coherent Systems and the Reliability Polynomial
• Computational algebraic algorithms for the reliability of generalized \(k\)-out-of-\(n\) and related systems
• Combinatorial-graphic method of reliability analysis of complex systems with monotone Boolean functions
• scientific article; zbMATH DE number 50879
• Two Recursive Algorithms for Computing the Reliability of k-out-of-n Systems
• Algorithm for reliability of (1,2) or (2,1)-out-of (n;2):F systems
• scientific article; zbMATH DE number 969168
• Combinatorial and Geometric View of the System Reliability Theory

Cites work

• A Pruned Tree Approach to Reliability Computation
• An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per Cutset
• Enumeration of All Minimal Cut-Sets for a Node Pair in a Graph
• scientific article; zbMATH DE number 3215084 (Why is no real title available?)

Cited in

(1)

• Applications of a Subset-Generating Algorithm to Base Enumeration, Knapsack and Minimal Covering Problems

Describes a project that uses

Uses Software

• Algorithm 447

This page was built for publication: An enumeration algorithm for combinatorial problems of the reliability analysis of binary coherent systems

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