Probabilistic Set Covering with Correlations

References

• Agrawal S, Ding Y, Saberi A, Ye Y. Price of correlations in stochastic optimization. Oper. Res. (2012) 60(1):150–162Link, Google Scholar
• Ahmed S, Atamtürk A. Maximizing a class of submodular utility functions. Math. Programming (2011) 128(1–2):149–169Crossref, Google Scholar
• Atamtürk A, Narayanan V. Polymatroids and mean-risk minimization in discrete optimization. Oper. Res. Lett. (2008) 36(5):618–622Crossref, Google Scholar
• Ben-Tal A, El Ghaoui L, Nemirovski A. Robust Optimization (2009) (Princeton University Press, Princeton, NJ) Crossref, Google Scholar
• Beraldi P, Bruni ME. An exact approach for solving integer problems under probabilistic constraints with random technology matrix. Ann. Oper. Res. (2010) 177:127–137Crossref, Google Scholar
• Beraldi P, Ruszczyński A. The probabilistic set-covering problem. Oper. Res. (2002) 50(6):956–967Link, Google Scholar
• Calafiore G, Campi MC. Uncertain convex programs: Randomized solutions and confidence levels. Math. Programming (2005) 102:25–46Crossref, Google Scholar
• Edmonds J. Combinatorial Structures and Their Applications (1971) (Gordon and Breach, New York) Google Scholar
• Erdogan E, Iyengar G. Ambiguous chance constrained problems and robust optimization. Math. Programming (2006) 107(1):37–61Crossref, Google Scholar
• Fischetti M, Monaci M. Cutting plane versus compact formulations for uncertain (integer) linear programs. Math. Programming Comput. (2012) 4(3):239–273Crossref, Google Scholar
• Goemans M, Vondrák J, Corea J, Hevla A, Kiwi M. Stochastic covering and adaptivity. Proc. 7th Latin Amer. Conf. Theoret. Informatics (2006) (Springer-Verlag, Berlin) 532–543Crossref, Google Scholar
• Haight RG, Revelle CS, Snyder SA. An integer optimization approach to a probabilistic reserve site selection problem. Oper. Res. (2000) 48(5):697–708Link, Google Scholar
• Kleywegt AJ, Shapiro A, Homem-de Mello T. The sample average approximation method for stochastic discrete optimization. SIAM J. Optim. (2002) 12(2):479–502Crossref, Google Scholar
• Kuai H, Alajaji F, Takahara G. A lower bound on the probability of a finite union of events. Discrete Math. (2000) 215(1–3):147–158Crossref, Google Scholar
• Luedtke J, Ahmed S. A sample approximation approach for optimization with probabilistic constraints. SIAM J. Optim. (2008) 19(2):674–699Crossref, Google Scholar
• Nemirovski A, Shapiro A. Convex approximations of chance constrained programs. SIAM J. Optim. (2006a) 17(4):969–996Crossref, Google Scholar
• Nemirovski A, Shapiro A, Calafiore G, Dabbene F. Scenario approximations of chance constraints. Probabilistic and Randomized Methods for Design Under Uncertainty (2006b) (Springer, London) Crossref, Google Scholar
• Pintér J. Deterministic approximations of probability inequalities. Math. Methods Oper. Res. (1989) 33(4):219–239Crossref, Google Scholar
• Prékopa A. Stochastic Programming (1995) (Kluwer Academic Publishers, Amsterdam) Crossref, Google Scholar
• Prékopa A, Gao L. Bounding the probability of the union of events by aggregation and disaggregation in linear programs. Discrete Appl. Math. (2005) 145(3):444–454Crossref, Google Scholar
• Saxena A, Goyal V, Lejeune MA. MIP reformulations of the probabilistic set covering problem. Math. Programming (2010) 121(1):1–31Crossref, Google Scholar
• Shapiro A, Dentcheva D, Ruszczyński A. Lectures on Stochastic Programming (2009) (Society for Industrial and Applied Mathematics, Philadelphia) Crossref, Google Scholar
• Topkis DM. Supermodularity and Complementarity (1998) (Princeton University Press, Princeton, NJ) Crossref, Google Scholar