Pages that link to "Item:Q3635155"

The following pages link to The Probabilistic Set-Covering Problem (Q3635155):

Displaying 41 items.

• Chance-constrained problems and rare events: an importance sampling approach (Q291054) (← links)
• Decomposition algorithms for two-stage chance-constrained programs (Q291060) (← links)
• A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support (Q403644) (← links)
• Capital rationing problems under uncertainty and risk (Q429488) (← links)
• Mixed integer linear programming formulations for probabilistic constraints (Q439901) (← links)
• Exact algorithms on reliable routing problems under uncertain topology using aggregation techniques for exponentially many scenarios (Q513625) (← links)
• Nonanticipative duality, relaxations, and formulations for chance-constrained stochastic programs (Q517291) (← links)
• Easy distributions for combinatorial optimization problems with probabilistic constraints (Q614036) (← links)
• Branch-and-cut approaches for chance-constrained formulations of reliable network design problems (Q744205) (← links)
• MIP reformulations of the probabilistic set covering problem (Q847820) (← links)
• Stochastic 0-1 linear programming under limited distributional information (Q935201) (← links)
• Mathematical programming approaches for generating \(p\)-efficient points (Q992653) (← links)
• A polyhedral study on chance constrained program with random right-hand side (Q1683680) (← links)
• Improved handling of uncertainty and robustness in set covering problems (Q1695010) (← links)
• Optimization models of anti-terrorist protection (Q1735316) (← links)
• Designing robust emergency medical service via stochastic programming (Q1827657) (← links)
• Lagrangian decomposition and mixed-integer quadratic programming reformulations for probabilistically constrained quadratic programs (Q1926817) (← links)
• Multivariate value at risk and related topics (Q1931628) (← links)
• An exact approach for solving integer problems under probabilistic constraints with random technology matrix (Q1958623) (← links)
• Orientational variable-length strip covering problem: a branch-and-price-based algorithm (Q2028818) (← links)
• Robust min-max regret covering problems (Q2162527) (← links)
• An exact method for constrained maximization of the conditional value-at-risk of a class of stochastic submodular functions (Q2183220) (← links)
• Robust strategic planning for mobile medical units with steerable and unsteerable demands (Q2239842) (← links)
• Solving multistatic sonar location problems with mixed-integer programming (Q2303531) (← links)
• The risk-averse traveling repairman problem with profits (Q2317622) (← links)
• Cutting plane versus compact formulations for uncertain (integer) linear programs (Q2392865) (← links)
• Proportional and maxmin fairness for the sensor location problem with chance constraints (Q2414477) (← links)
• An algorithm for binary linear chance-constrained problems using IIS (Q2419523) (← links)
• On mixing sets arising in chance-constrained programming (Q2429465) (← links)
• Beam search heuristic to solve stochastic integer problems under probabilistic constraints (Q2484339) (← links)
• A branch-reduce-cut algorithm for the global optimization of probabilistically constrained linear programs (Q2502217) (← links)
• The mixed capacitated general routing problem under uncertainty (Q2629641) (← links)
• Chance constrained unit commitment approximation under stochastic wind energy (Q2669502) (← links)
• Chance-constrained set covering with Wasserstein ambiguity (Q2687060) (← links)
• Chance-Constrained Binary Packing Problems (Q2940063) (← links)
• Probabilistic Partial Set Covering with an Oracle for Chance Constraints (Q4629339) (← links)
• A Sequential Algorithm for Solving Nonlinear Optimization Problems with Chance Constraints (Q4637499) (← links)
• A branch and bound method for stochastic integer problems under probabilistic constraints (Q4709729) (← links)
• ALSO-X and ALSO-X+: Better Convex Approximations for Chance Constrained Programs (Q5060524) (← links)
• An Augmented Lagrangian Decomposition Method for Chance-Constrained Optimization Problems (Q5085476) (← links)
• Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness (Q6114933) (← links)