Pages that link to "Item:Q5247622"
From MaRDI portal
The following pages link to Polynomially Computable Bounds for the Probability of the Union of Events (Q5247622):
Displaying 13 items.
- A-priori upper bounds for the set covering problem (Q271942) (← links)
- A combinatorial optimization approach to the selection of statistical units (Q747022) (← links)
- Strengthened bounds for the probability of \(k\)-out-of-\(n\) events (Q897611) (← links)
- Complexity of some graph-based bounds on the probability of a union of events (Q1752603) (← links)
- Optimization algorithms for resilient path selection in networks (Q2027082) (← links)
- Bounds for the probability of union of events following monotonic distribution (Q2030441) (← links)
- The value of shape constraints in discrete moment problems: a review and extension (Q2095900) (← links)
- Sharp bounds for the probability of union of \(n\) events when \(m\) number of binomial moments are known (Q2303530) (← links)
- New bounds for the probability that at least \(k\)-out-of-\(n\) events occur with unimodal distributions (Q2357784) (← links)
- Sharp probability bounds for the binomial moment problem with symmetry (Q2417044) (← links)
- Linear programming bounds on the union probability (Q5087556) (← links)
- Lower Bounds on the Probability of a Finite Union of Events (Q5741087) (← links)
- Tight Probability Bounds with Pairwise Independence (Q6158360) (← links)
