Polynomially computable bounds for the probability of the union of events
Year of publication: |
2014
|
---|---|
Authors: | Boros, Endre ; Scozzari, Andrea ; Tardella, Fabio ; Veneziani, Pierangela |
Published in: |
Mathematics of operations research. - Catonsville, MD : INFORMS, ISSN 0364-765X, ZDB-ID 195683-8. - Vol. 39.2014, 4, p. 1311-1329
|
Subject: | probability bounds | probability of the union | submodular functions | polyhedral combinatorics | Theorie | Theory | Wahrscheinlichkeitsrechnung | Probability theory | Mathematische Optimierung | Mathematical programming |
-
Chebyshev inequalities for products of random variables
Rujeerapaiboon, Napat, (2018)
-
Mullahy, John, (2018)
-
Improved bounds on the probability of the union of events some of whose intersections are empty
Yoda, Kunikazu, (2016)
- More ...
-
Exact and heuristic approaches for the index tracking problem with UCITS constraints
Scozzari, Andrea, (2013)
-
A new method for mean-variance portfolio optimization with cardinality constraints
Cesarone, Francesco, (2013)
-
Linear vs quadratic portfolio selection models with hard real-world constraints
Cesarone, Francesco, (2015)
- More ...