Pages that link to "Item:Q517291"

The following pages link to Nonanticipative duality, relaxations, and formulations for chance-constrained stochastic programs (Q517291):

Displaying 26 items.

• Decomposition algorithms for optimizing multi-server appointment scheduling with chance constraints (Q291063) (← links)
• Relaxations and approximations of chance constraints under finite distributions (Q1650766) (← links)
• Scenario cluster Lagrangean decomposition for risk averse in multistage stochastic optimization (Q1652363) (← links)
• On quantile cuts and their closure for chance constrained optimization problems (Q1801023) (← links)
• A fractional stochastic integer programming problem for reliability-to-stability ratio in forest harvesting (Q1989738) (← links)
• Soft clustering-based scenario bundling for a progressive hedging heuristic in stochastic service network design (Q2027067) (← links)
• Lagrangian relaxation based heuristics for a chance-constrained optimization model of a hybrid solar-battery storage system (Q2046320) (← links)
• Data-driven tuning for chance constrained optimization: analysis and extensions (Q2085821) (← links)
• Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens (Q2089774) (← links)
• Special issue: Global solution of integer, stochastic and nonconvex optimization problems (Q2097627) (← links)
• Optimized Bonferroni approximations of distributionally robust joint chance constraints (Q2118072) (← links)
• On distributionally robust chance constrained programs with Wasserstein distance (Q2227531) (← links)
• Lagrange dual bound computation for stochastic service network design (Q2672131) (← links)
• On the Quantile Cut Closure of Chance-Constrained Problems (Q3186519) (← links)
• Optimization-Driven Scenario Grouping (Q3386802) (← links)
• Scenario Grouping and Decomposition Algorithms for Chance-Constrained Programs (Q4995100) (← 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)
• An Augmented Lagrangian Decomposition Method for Chance-Constrained Optimization Problems (Q5085476) (← links)
• Multiproduct Newsvendor Problem with Customer-Driven Demand Substitution: A Stochastic Integer Program Perspective (Q5085489) (← links)
• Bicriteria Approximation of Chance-Constrained Covering Problems (Q5131473) (← links)
• Parallel Scenario Decomposition of Risk-Averse 0-1 Stochastic Programs (Q5131712) (← links)
• Scalable Algorithms for the Sparse Ridge Regression (Q5148400) (← links)
• Probability maximization via Minkowski functionals: convex representations and tractable resolution (Q6038654) (← links)
• On approximations of data-driven chance constrained programs over Wasserstein balls (Q6106524) (← links)
• Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness (Q6114933) (← links)