Pages that link to "Item:Q2502217"
From MaRDI portal
The following pages link to A branch-reduce-cut algorithm for the global optimization of probabilistically constrained linear programs (Q2502217):
Displayed 11 items.
- An integer programming approach for linear programs with probabilistic constraints (Q847852) (← links)
- IIS branch-and-cut for joint chance-constrained stochastic programs and application to optimal vaccine allocation (Q992606) (← links)
- Lagrangian decomposition and mixed-integer quadratic programming reformulations for probabilistically constrained quadratic programs (Q1926817) (← links)
- Value-at-risk optimization using the difference of convex algorithm (Q1929961) (← links)
- An exact approach for solving integer problems under probabilistic constraints with random technology matrix (Q1958623) (← links)
- A linear programming approach for linear programs with probabilistic constraints (Q2356018) (← links)
- Fuzzy Chance-Constrained Project Portfolio Selection Model Based on Credibility Theory (Q2963717) (← links)
- A difference of convex formulation of value-at-risk constrained optimization (Q3577837) (← links)
- An Augmented Lagrangian Decomposition Method for Chance-Constrained Optimization Problems (Q5085476) (← links)
- Bicriteria Approximation of Chance-Constrained Covering Problems (Q5131473) (← links)
- Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness (Q6114933) (← links)