Pages that link to "Item:Q1650766"
From MaRDI portal
The following pages link to Relaxations and approximations of chance constraints under finite distributions (Q1650766):
Displaying 12 items.
- Bounds for probabilistic programming with application to a blend planning problem (Q2060407) (← links)
- Chance-constrained sets approximation: a probabilistic scaling approach (Q2071956) (← links)
- Special issue: Global solution of integer, stochastic and nonconvex optimization problems (Q2097627) (← links)
- Data-driven project portfolio selection: decision-dependent stochastic programming formulations with reliability and time to market requirements (Q2147012) (← links)
- Nonconvex and nonsmooth approaches for affine chance-constrained stochastic programs (Q2158841) (← links)
- Relaxation schemes for the joint linear chance constraint based on probability inequalities (Q2165806) (← links)
- Approximation algorithms for the covering-type \(k\)-violation linear program (Q2329669) (← links)
- Arc routing under uncertainty: introduction and literature review (Q2669541) (← links)
- ALSO-X and ALSO-X+: Better Convex Approximations for Chance Constrained Programs (Q5060524) (← links)
- Chance-Constrained Multiple Bin Packing Problem with an Application to Operating Room Planning (Q5084621) (← 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)
