Probability bounds with cherry trees

Mathematics of Operations Research

Volumn 26, Issue 1, 2001, Pages 174-192

  Bukszár, József ^a   Prékopa, András ^b  

^a UNIVERSITY OF MISKOLC   (Hungary)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

Hypergraphs; Linear programming; Normal distribution; Probability bounds

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; GRAPH THEORY; LINEAR PROGRAMMING; PROBABILITY; RECURSIVE FUNCTIONS; VECTORS;

PROBABILITY BOUNDS;

TREES (MATHEMATICS);

EID: 0035261820     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.26.1.174.10596     Document Type: Article

References (17)

1. Teoria statistica delle classi e calcolo delle probabilitá
2. Closed form two-sided bounds for probabilities that exactly r and at least r out of n events occur
3. Inequality for probabilities
4. Best possible inequalities for the probability of a logical function of events
5. A Bonferroni-type identity and permutation bounds
6. An upper bound for the probability of a union
7. Best linear Bonferroni bounds
8. Bounds on the probability of a union and intersection of m events
9. Sharp bounds on probabilities using linear programming
10. Boole-Bonferroni inequalities and linear programming
11. Lower and upper bounds on probabilities of boolean functions of events
12. Multivariate normal probabilities with error bound
13. Improved bounds and simulation procedures on the value of the multivariate normal probability distribution function
14. An improved Bonferroni inequality and applications