Probabilistic set covering with correlations
From MaRDI portal
Recommendations
Cited in
(22)- The Probabilistic Set-Covering Problem
- Polyhedral results for a class of cardinality constrained submodular minimization problems
- Set coverage and robust policy
- Ambiguous risk constraints with moment and unimodality information
- Data-driven chance constrained stochastic program
- On bounding the union probability using partial weighted information
- Probabilistic partial set covering with an oracle for chance constraints
- Nonanticipative duality, relaxations, and formulations for chance-constrained stochastic programs
- Linear programming bounds on the union probability
- MIP reformulations of the probabilistic set covering problem
- An efficient computational method for large scale surgery scheduling problems with chance constraints
- An algorithm for binary linear chance-constrained problems using IIS
- Improved handling of uncertainty and robustness in set covering problems
- Strengthened bounds for the probability of \(k\)-out-of-\(n\) events
- An exact method for constrained maximization of the conditional value-at-risk of a class of stochastic submodular functions
- Advances in the decision-making of set covering models under uncertainty
- Stochastic minimum vertex cover in general graphs: a 3/2-approximation
- Chance-constrained set covering with Wasserstein ambiguity
- Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness
- Exact algorithms on reliable routing problems under uncertain topology using aggregation techniques for exponentially many scenarios
- ALSO-X and ALSO-X+: Better Convex Approximations for Chance Constrained Programs
- Benders decomposition for the large-scale probabilistic set covering problem
This page was built for publication: Probabilistic set covering with correlations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5301138)
