Variable aggregation and its effect on union bounding problem

DOI10.1007/S10479-026-07098-WMaRDI QIDQ7320304zbMATH OpenFDO

Authors Joonhee Lee

Publication date 27 August 2026

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10479-026-07098-W

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• A linear programming approach to reasoning about probabilities
• An Inequality for Probabilities
• Best Possible Inequalities for the Probability of a Logical Function of Events
• Best second order bounds for two-terminal network reliability with dependent edge failures
• Bonferroni inequalities
• Boole's probability bounding problem, linear programming aggregations, and nonnegative quadratic pseudo-Boolean functions
• Bounding the probability of the union of events by aggregation and disaggregation in linear programs
• Bounds on the probability of the union and intersection of m events
• Chvátal Cuts and Odd Cycle Inequalities in Quadratic 0–1 Optimization
• Column Generation Methods for Probabilistic Logic
• Geometry of cuts and metrics
• scientific article; zbMATH DE number 3076638 (Why is no real title available?)
• Inequalities for the probability of the occurrence of at least m out of n events
• Linear programming bounds on the union probability
• Most Stringent Bounds on Aggregated Probabilities of Partially Specified Dependent Probability Systems
• Polynomially computable bounds for the probability of the union of events
• Sharp Bounds on Probabilities Using Linear Programming

This page was built for publication: Variable aggregation and its effect on union bounding problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7320304)