THE TREE CUT AND MERGE ALGORITHM FOR ESTIMATION OF NETWORK RELIABILITY

DOI10.1017/S0269964803171021zbMath1064.90012WikidataQ118141962 ScholiaQ118141962MaRDI QIDQ4805461

Dirk P. Kroese, Miro Kraetzl, Kin-Ping Hui, Nigel G. Bean

Publication date: 2003

Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Reliability, availability, maintenance, inspection in operations research (90B25) Reliability and life testing (62N05)

Related Items (5)

Fast computation of bounds for two-terminal network reliability ⋮ Finding the probability of infection in an SIR network is NP-hard ⋮ Cooperative cross-entropy method for generating entangled networks ⋮ A new simulation method based on the RVR principle for the rare event network reliability problem ⋮ The cross-entropy method for network reliability estimation

This page was built for publication: THE TREE CUT AND MERGE ALGORITHM FOR ESTIMATION OF NETWORK RELIABILITY