Tighter reformulations using classical Dawson and Sankoff bounds for approximating two-stage chance-constrained programs (Q828647): Difference between revisions

@@ Property / cites work @@
+Optimal Inequalities in Probability Theory: A Convex Optimization Approach
+Normal rank
@@ Property / cites work @@
+Probability Bounds with Cherry Trees
@@ Property / cites work: Probability Bounds with Cherry Trees / rank @@
+Normal rank
@@ Property / cites work @@
+An Inequality for Probabilities
@@ Property / cites work: An Inequality for Probabilities / rank @@
+Normal rank
@@ Property / cites work @@
+Bonferroni-Type Inequalities  via Chordal Graphs
@@ Property / cites work: Bonferroni-Type Inequalities via Chordal Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4040797
@@ Property / cites work: Q4040797 / rank @@
+Normal rank
@@ Property / cites work @@
+Most Stringent Bounds on Aggregated Probabilities of Partially Specified Dependent Probability Systems
+Normal rank
@@ Property / cites work @@
+Q3126752
@@ Property / cites work: Q3126752 / rank @@
+Normal rank
@@ Property / cites work @@
+Bounding the probability of the union of events by aggregation and disaggregation in linear programs
+Normal rank
@@ Property / cites work @@
+Inequalities for the probability of the occurrence of at least <i>m</i> out of <i>n</i> events
+Normal rank
@@ Property / cites work @@
+Complexity of some graph-based bounds on the probability of a union of events
+Normal rank
@@ Property / cites work @@
+Approximating two-stage chance-constrained programs with classical probability bounds
+Normal rank