Probabilistic Set Covering with Correlations
From MaRDI portal
Publication:5301138
DOI10.1287/opre.1120.1135zbMath1267.90081OpenAlexW1966387432MaRDI QIDQ5301138
Dimitri J. Papageorgiou, Shabbir Ahmed
Publication date: 2 July 2013
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.1120.1135
Related Items (16)
On bounding the union probability using partial weighted information ⋮ Data-driven chance constrained stochastic program ⋮ ALSO-X and ALSO-X+: Better Convex Approximations for Chance Constrained Programs ⋮ Linear programming bounds on the union probability ⋮ An exact method for constrained maximization of the conditional value-at-risk of a class of stochastic submodular functions ⋮ An algorithm for binary linear chance-constrained problems using IIS ⋮ Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness ⋮ Strengthened bounds for the probability of \(k\)-out-of-\(n\) events ⋮ Improved handling of uncertainty and robustness in set covering problems ⋮ Chance-constrained set covering with Wasserstein ambiguity ⋮ Ambiguous risk constraints with moment and unimodality information ⋮ Probabilistic Partial Set Covering with an Oracle for Chance Constraints ⋮ An efficient computational method for large scale surgery scheduling problems with chance constraints ⋮ Exact algorithms on reliable routing problems under uncertain topology using aggregation techniques for exponentially many scenarios ⋮ Nonanticipative duality, relaxations, and formulations for chance-constrained stochastic programs ⋮ Polyhedral results for a class of cardinality constrained submodular minimization problems
This page was built for publication: Probabilistic Set Covering with Correlations
