The Probabilistic Set-Covering Problem
From MaRDI portal
Publication:3635155
DOI10.1287/opre.50.6.956.345zbMath1163.90655OpenAlexW2156206831MaRDI QIDQ3635155
Ruszczyński, Andrzej, Patrizia Beraldi
Publication date: 3 July 2009
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.50.6.956.345
Related Items
Chance-constrained problems and rare events: an importance sampling approach, Decomposition algorithms for two-stage chance-constrained programs, The mixed capacitated general routing problem under uncertainty, MIP reformulations of the probabilistic set covering problem, ALSO-X and ALSO-X+: Better Convex Approximations for Chance Constrained Programs, Cutting plane versus compact formulations for uncertain (integer) linear programs, Robust min-max regret covering problems, An Augmented Lagrangian Decomposition Method for Chance-Constrained Optimization Problems, Chance-Constrained Binary Packing Problems, Chance constrained unit commitment approximation under stochastic wind energy, Lagrangian decomposition and mixed-integer quadratic programming reformulations for probabilistically constrained quadratic programs, Proportional and maxmin fairness for the sensor location problem with chance constraints, An exact method for constrained maximization of the conditional value-at-risk of a class of stochastic submodular functions, Easy distributions for combinatorial optimization problems with probabilistic constraints, A polyhedral study on chance constrained program with random right-hand side, Multivariate value at risk and related topics, An algorithm for binary linear chance-constrained problems using IIS, A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support, Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness, Improved handling of uncertainty and robustness in set covering problems, Chance-constrained set covering with Wasserstein ambiguity, On mixing sets arising in chance-constrained programming, Capital rationing problems under uncertainty and risk, Mixed integer linear programming formulations for probabilistic constraints, An exact approach for solving integer problems under probabilistic constraints with random technology matrix, Probabilistic Partial Set Covering with an Oracle for Chance Constraints, Stochastic 0-1 linear programming under limited distributional information, Optimization models of anti-terrorist protection, A Sequential Algorithm for Solving Nonlinear Optimization Problems with Chance Constraints, Robust strategic planning for mobile medical units with steerable and unsteerable demands, 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, Beam search heuristic to solve stochastic integer problems under probabilistic constraints, A branch-reduce-cut algorithm for the global optimization of probabilistically constrained linear programs, Orientational variable-length strip covering problem: a branch-and-price-based algorithm, Mathematical programming approaches for generating \(p\)-efficient points, Branch-and-cut approaches for chance-constrained formulations of reliable network design problems, A branch and bound method for stochastic integer problems under probabilistic constraints, Solving multistatic sonar location problems with mixed-integer programming, The risk-averse traveling repairman problem with profits, Designing robust emergency medical service via stochastic programming
