Library Header Image
LSE Research Online LSE Library Services

Efficient multicut enumeration of k -out-of- n:F and consecutive k -out-of- n:F systems

Mohammadi, Fatemeh and Saenz-de-Cabezon, Eduardo and Wynn, Henry P. (2018) Efficient multicut enumeration of k -out-of- n:F and consecutive k -out-of- n:F systems. Pattern Recognition Letters, 102. pp. 82-88. ISSN 0167-8655

[img] Text - Accepted Version
Restricted to Repository staff only until 19 December 2018.

Download (404kB) | Request a copy

Identification Number: 10.1016/j.patrec.2017.12.021


We study multiple simultaneous cut events for k-out-of-n:F and linear consecutive k-out-of-n:F systems in which each component has a constant failure probability. We list the multicuts of these systems and describe the structural differences between them. Our approach, based on combinatorial commutative algebra, allows complete enumeration of the sets of multicuts for both kinds of systems. We also analyze the computational issues of multicut enumeration and reliability computations

Item Type: Article
Official URL:
Additional Information: © 2017 Elsevier B.V.
Divisions: Statistics
Subjects: H Social Sciences > HA Statistics
Sets: Departments > Statistics
Date Deposited: 16 Jan 2018 15:20
Last Modified: 28 Sep 2018 08:23

Actions (login required)

View Item View Item


Downloads per month over past year

View more statistics