Pages that link to "Item:Q847820"

The following pages link to MIP reformulations of the probabilistic set covering problem (Q847820):

Displaying 29 items.

• 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)
• Mixed integer linear programming formulations for probabilistic constraints (Q439901) (← links)
• Easy distributions for combinatorial optimization problems with probabilistic constraints (Q614036) (← links)
• Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations (Q652290) (← links)
• Branch-and-cut approaches for chance-constrained formulations of reliable network design problems (Q744205) (← 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)
• An efficient computational method for large scale surgery scheduling problems with chance constraints (Q1744896) (← 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)
• Algorithm to optimize the quantile criterion for the polyhedral loss function and discrete distribution of random parameters (Q2261687) (← links)
• General properties of two-stage stochastic programming problems with probabilistic criteria (Q2290416) (← links)
• A new approach for solving set covering problem using jumping particle swarm optimization method (Q2311260) (← 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)
• Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations (Q2638381) (← links)
• Chance-constrained set covering with Wasserstein ambiguity (Q2687060) (← links)
• AN IMPROVED CONVEX 0-1 QUADRATIC PROGRAM REFORMULATION FOR CHANCE-CONSTRAINED QUADRATIC KNAPSACK PROBLEMS (Q2846489) (← links)
• Chance-Constrained Binary Packing Problems (Q2940063) (← links)
• Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs (Q3503837) (← links)
• Reformulations in Mathematical Programming: Definitions and Systematics (Q3621976) (← links)
• Probabilistic Partial Set Covering with an Oracle for Chance Constraints (Q4629339) (← links)
• Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness (Q6114933) (← links)