Pages that link to "Item:Q1197883"

The following pages link to Relaxations for probabilistically constrained programs with discrete random variables (Q1197883):

Displaying 37 items.

• On the mixing set with a knapsack constraint (Q291057) (← links)
• Decomposition algorithms for two-stage chance-constrained programs (Q291060) (← links)
• Mixed integer linear programming formulations for probabilistic constraints (Q439901) (← links)
• On reducing a quantile optimization problem with discrete distribution to a mixed integer programming problem (Q462008) (← links)
• A sampling-and-discarding approach to chance-constrained optimization: feasibility and Optimality (Q535064) (← links)
• Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations (Q652290) (← links)
• MIP reformulations of the probabilistic set covering problem (Q847820) (← links)
• Integrated chance constraints: reduced forms and an algorithm (Q867427) (← links)
• IIS branch-and-cut for joint chance-constrained stochastic programs and application to optimal vaccine allocation (Q992606) (← links)
• Mathematical programming approaches for generating \(p\)-efficient points (Q992653) (← links)
• Estimated stochastic programs with chance constraints (Q1278960) (← links)
• On the convergence of sample approximations for stochastic programming problems with probabilistic criteria (Q1642031) (← links)
• A polyhedral study on chance constrained program with random right-hand side (Q1683680) (← links)
• A polyhedral study of the static probabilistic lot-sizing problem (Q1708524) (← links)
• Convergence conditions for the observed mean method in stochastic programming (Q1745693) (← links)
• Bounds for probabilistic integer programming problems (Q1850114) (← links)
• Lagrangian decomposition and mixed-integer quadratic programming reformulations for probabilistically constrained quadratic programs (Q1926817) (← links)
• Regularization methods for optimization problems with probabilistic constraints (Q1949268) (← links)
• An exact approach for solving integer problems under probabilistic constraints with random technology matrix (Q1958623) (← links)
• Bounds for probabilistic programming with application to a blend planning problem (Q2060407) (← links)
• Nonconvex and nonsmooth approaches for affine chance-constrained stochastic programs (Q2158841) (← 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)
• On mixing sets arising in chance-constrained programming (Q2429465) (← links)
• Genetic algorithm based technique for solving chance constrained problems (Q2464197) (← 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 \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification (Q2570997) (← links)
• Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations (Q2638381) (← links)
• Chance constrained unit commitment approximation under stochastic wind energy (Q2669502) (← links)
• Solving Chance-Constrained Optimization Problems with Stochastic Quadratic Inequalities (Q2830767) (← links)
• AN IMPROVED CONVEX 0-1 QUADRATIC PROGRAM REFORMULATION FOR CHANCE-CONSTRAINED QUADRATIC KNAPSACK PROBLEMS (Q2846489) (← links)
• Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs (Q3503837) (← links)
• A branch and bound method for stochastic integer problems under probabilistic constraints (Q4709729) (← 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)
• A solution algorithm for chance-constrained problems with integer second-stage recourse decisions (Q6126651) (← links)