Polynomially Computable Bounds for the Probability of the Union of Events
From MaRDI portal
Publication:5247622
DOI10.1287/moor.2014.0657zbMath1314.60033OpenAlexW2056815865WikidataQ59560504 ScholiaQ59560504MaRDI QIDQ5247622
Andrea Scozzari, Endre Boros, Fabio Tardella, Pierangela Veneziani
Publication date: 24 April 2015
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/a867c33033c156f0199d465abed29239526d5756
Related Items (13)
New bounds for the probability that at least \(k\)-out-of-\(n\) events occur with unimodal distributions ⋮ A-priori upper bounds for the set covering problem ⋮ Linear programming bounds on the union probability ⋮ Sharp probability bounds for the binomial moment problem with symmetry ⋮ Strengthened bounds for the probability of \(k\)-out-of-\(n\) events ⋮ Tight Probability Bounds with Pairwise Independence ⋮ Complexity of some graph-based bounds on the probability of a union of events ⋮ Lower Bounds on the Probability of a Finite Union of Events ⋮ Optimization algorithms for resilient path selection in networks ⋮ Bounds for the probability of union of events following monotonic distribution ⋮ A combinatorial optimization approach to the selection of statistical units ⋮ Sharp bounds for the probability of union of \(n\) events when \(m\) number of binomial moments are known ⋮ The value of shape constraints in discrete moment problems: a review and extension
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lower bounds for the probability of a union via chordal graphs
- Submodular function minimization
- Upper bounds of degree 3 for the probability of the union of events via linear programming
- Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functions
- Hypertrees and Bonferroni inequalities
- Probabilistic satisfiability
- Bonferroni inequalities
- The use of discrete moment bounds in probabilistic constrained stochastic programming models
- A linear programming approach to reasoning about probabilities
- A lower bound on the probability of a union
- 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
- On the supermodular knapsack problem
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- A lower bound on the probability of a finite union of events
- Probability Bounds with Cherry Trees
- Bonferroni-Type Inequalities via Chordal Graphs
- Sharp Bounds on Probabilities Using Linear Programming
- New upper bounds on the probability of events based on graph structures
- A sharp upper probability bound for the occurrence of at least m out of n events
- Boole-Bonferroni Inequalities and Linear Programming
- Closed Form Two-Sided Bounds for Probabilities that At Least r and Exactly r Out of n Events Occur
- Polynomial algorithms for estimating network reliability
- An improved Bonferroni inequality and applications
- Column Generation Methods for Probabilistic Logic
- Best Linear Bonferroni Bounds
- Bounds on the probability of the union and intersection of m events
- An upper bound for the probability of a union
- Most Stringent Bounds on Aggregated Probabilities of Partially Specified Dependent Probability Systems
- Cut-Polytopes, Boolean Quadric Polytopes and Nonnegative Quadratic Pseudo-Boolean Functions
- Best Possible Inequalities for the Probability of a Logical Function of Events
- An Inequality for Probabilities
- Bounds for the Probability of a Union, with Applications
This page was built for publication: Polynomially Computable Bounds for the Probability of the Union of Events
