Best second order bounds for two-terminal network reliability with dependent edge failures
From MaRDI portal
Recommendations
Cites work
- A linear programming approach to reasoning about probabilities
- Algorithms for the maximum satisfiability problem
- Best Possible Inequalities for the Probability of a Logical Function of Events
- Boole's conditions of possible experience and reasoning under uncertainty
- Boole's logic and probability. A critical exposition from the standpoint of contemporary algebra, logic and probability theory. 2nd ed., rev. and enlarged
- Column Generation Methods for Probabilistic Logic
- First-and second-order bounds on terminal reliability
- scientific article; zbMATH DE number 5838699 (Why is no real title available?)
- scientific article; zbMATH DE number 3152649 (Why is no real title available?)
- scientific article; zbMATH DE number 3717129 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 795224 (Why is no real title available?)
- scientific article; zbMATH DE number 3249560 (Why is no real title available?)
- Improving reliability bounds in computer networks
- L’algebre de Boole et ses applications en recherche operationnelle
- On the Existence of a Feasible Flow in a Stochastic Transportation Network
- Polynomial algorithms for estimating network reliability
- Probabilistic logic
- Probabilistic satisfiability
- State-of-the-Art Survey—Constrained Nonlinear 0–1 Programming
- Tabu Search—Part I
- Tabu Search—Part II
- The Failure Frequency of Systems with Dependent Components
Cited in
(5)
This page was built for publication: Best second order bounds for two-terminal network reliability with dependent edge failures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1961463)