Polynomially computable bounds for the probability of the union of events
From MaRDI portal
Recommendations
- Bounding the probability of the union of events by aggregation and disaggregation in linear programs
- Upper bounds of degree 3 for the probability of the union of events via linear programming
- Improved bounds on the probability of the union of events some of whose intersections are empty
- scientific article; zbMATH DE number 1724439
- Graph-based upper bounds for the probability of the union of events
Cites work
- A linear programming approach to reasoning about probabilities
- A lower bound on the probability of a finite union of events
- A lower bound on the probability of a union
- A sharp upper probability bound for the occurrence of at least m out of n events
- An improved Bonferroni inequality and applications
- An Inequality for Probabilities
- An upper bound for the probability of a union
- Best Linear Bonferroni Bounds
- Best Possible Inequalities for the Probability of a Logical Function of Events
- Bonferroni inequalities
- Bonferroni-Type Inequalities via Chordal Graphs
- Boole-Bonferroni Inequalities and Linear Programming
- Bounding the probability of the union of events by aggregation and disaggregation in linear programs
- Bounds for the Probability of a Union, with Applications
- Bounds on the probability of the union and intersection of m events
- Closed Form Two-Sided Bounds for Probabilities that At Least r and Exactly r Out of n Events Occur
- Column Generation Methods for Probabilistic Logic
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Complexity of some graph-based bounds on the probability of a union of events
- Cut-Polytopes, Boolean Quadric Polytopes and Nonnegative Quadratic Pseudo-Boolean Functions
- scientific article; zbMATH DE number 3712897 (Why is no real title available?)
- scientific article; zbMATH DE number 1446741 (Why is no real title available?)
- scientific article; zbMATH DE number 3422402 (Why is no real title available?)
- Hypertrees and Bonferroni inequalities
- Lower bounds for the probability of a union via chordal graphs
- Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functions
- Most Stringent Bounds on Aggregated Probabilities of Partially Specified Dependent Probability Systems
- New upper bounds on the probability of events based on graph structures
- On the supermodular knapsack problem
- Polynomial algorithms for estimating network reliability
- Probabilistic satisfiability
- Probability bounds with cherry trees.
- Sharp Bounds on Probabilities Using Linear Programming
- Submodular function minimization
- The use of discrete moment bounds in probabilistic constrained stochastic programming models
- Upper bounds of degree 3 for the probability of the union of events via linear programming
Cited in
(26)- Upper bounds of degree 3 for the probability of the union of events via linear programming
- Complexity of some graph-based bounds on the probability of a union of events
- Bounding the probability of the union of events by aggregation and disaggregation in linear programs
- Computing bounds for the probability of the union of events by different methods
- Optimization algorithms for resilient path selection in networks
- Bounds for the probability of union of events following monotonic distribution
- The value of shape constraints in discrete moment problems: a review and extension
- Sharp bounds for the probability of union of \(n\) events when \(m\) number of binomial moments are known
- New bounds for the probability that at least \(k\)-out-of-\(n\) events occur with unimodal distributions
- Sharp probability bounds for the binomial moment problem with symmetry
- Computing best-possible bounds for the distribution of a sum of several variables is NP-hard
- A-priori upper bounds for the set covering problem
- scientific article; zbMATH DE number 1724439 (Why is no real title available?)
- Inequalities for discrete higher order convex functions
- Boole-Bonferroni Inequalities and Linear Programming
- Disjoint Products and Efficient Computation of Reliability
- Extremal probability bounds in combinatorial optimization
- Linear programming bounds on the union probability
- Lower bounds on the probability of a finite union of events
- Tight Probability Bounds with Pairwise Independence
- Bounds for the probability of the union of events with unimodality
- Sharp bounds for the probability that exactly k-out-of-n events occur with unimodal distributions
- Clusters of high-dimensional interval data and related Boolean functions of events in Euclidean space
- Variable aggregation and its effect on union bounding problem
- A combinatorial optimization approach to the selection of statistical units
- Strengthened bounds for the probability of \(k\)-out-of-\(n\) events
This page was built for publication: Polynomially computable bounds for the probability of the union of events
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5247622)
