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

DOI10.1080/02331938808843400zbMath0668.05004OpenAlexW2055508918MaRDI QIDQ3820604

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

enumerationbacktrack algorithmreliability of networks

Mathematics Subject Classification ID

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

Uses Software

• Algorithm 447

Cites Work

• Unnamed Item
• 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

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