On the reliability estimation of stochastic binary systems

DOI10.1111/itor.13034OpenAlexW3185750840MaRDI QIDQ6071090

Pablo Romero, Unnamed Author, Héctor Cancela, Pablo Sartor, Franco Robledo

Publication date: 27 November 2023

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://hdl.handle.net/20.500.12381/645

zbMATH Keywords

dualitysplittingsystem reliabilitypermutation Monte Carlorecursive variance reductionstochastic binary systems

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient Monte Carlo simulation via the generalized splitting method
• Design of survivable networks
• Sixty years of network reliability
• A new simulation method based on the RVR principle for the rare event network reliability problem
• Using semi-Markov chains to solve semi-Markov processes
• Full complexity analysis of the diameter-constrained reliability
• Bi-objective stochastic programming models for determining depot locations in disaster relief operations
• Ternary Networks
• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
• Applying path-counting methods for measuring the robustness of the network-structured system
• Rare events, splitting, and quasi-Monte Carlo
• Robust multi‐objective optimization for water distribution system design using a meta‐metaheuristic
• Rare Event Simulation using Monte Carlo Methods
• Computational Complexity of Network Reliability Analysis: An Overview
• Sequential Destruction Method for Monte Carlo Evaluation of System Reliability
• Complexity of network reliability computations
• Estimation of network reliability using graph evolution models
• Computing the Reliability of Complex Networks
• A variant of importance splitting for rare event estimation
• Diameter constrained reliability: Complexity, distinguished topologies and asymptotic behavior
• On computing the 2‐diameter ‐constrained K ‐reliability of networks
• Reducibility among Combinatorial Problems
• Static Network Reliability Estimation under the Marshall-Olkin Copula
• Computational Complexity
• D-SPECTRUM AND RELIABILITY OF A BINARY SYSTEM WITH TERNARY COMPONENTS
• PERMUTATIONAL METHODS FOR PERFORMANCE ANALYSIS OF STOCHASTIC FLOW NETWORKS
• Integrating probabilistic design and rare‐event simulation into the requirements engineering process for high‐reliability systems
• Efficient estimation of distance‐dependent metrics in edge‐failing networks
• The complexity of theorem-proving procedures
• Monte Carlo for Estimating Exponential Convolution

This page was built for publication: On the reliability estimation of stochastic binary systems