Adaptive partitioning for chance-constrained problems with finite support
From MaRDI portal
Cites work
- A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support
- A primal-dual aggregation algorithm for minimizing conditional value-at-risk in linear programs
- A Sample Approximation Approach for Optimization with Probabilistic Constraints
- Adaptive partition-based SDDP algorithms for multistage stochastic linear programming with fixed recourse
- An adaptive partition-based approach for solving two-stage stochastic programs with fixed recourse
- An integer programming approach for linear programs with probabilistic constraints
- Branch-and-cut approaches for chance-constrained formulations of reliable network design problems
- Chance-Constrained Binary Packing Problems
- Covering linear programming with violations
- Data-Driven Approximation of Contextual Chance-Constrained Stochastic Programs
- Exact and heuristic solution techniques for mixed-integer quantile minimization problems
- Foundations of bilevel programming
- Generalized adaptive partition-based method for two-stage stochastic linear programs with fixed recourse
- scientific article; zbMATH DE number 194009 (Why is no real title available?)
- IIS branch-and-cut for joint chance-constrained stochastic programs and application to optimal vaccine allocation
- Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens
- Mixing mixed-integer inequalities
- Nonanticipative duality, relaxations, and formulations for chance-constrained stochastic programs
- On handling indicator constraints in mixed integer programming
- On mixing sets arising in chance-constrained programming
- On quantile cuts and their closure for chance constrained optimization problems
- On the mixing set with a knapsack constraint
- Optimization-Based Scenario Reduction for Data-Driven Two-Stage Stochastic Optimization
- Partition-based decomposition algorithms for two-stage stochastic integer programs with continuous recourse
- Sample average approximation method for chance constrained programming: Theory and applications
- Scenario reduction algorithms in stochastic programming
- Scenario reduction in stochastic programming
- Scenario reduction revisited: fundamental limits and guarantees
- Solving LP relaxations of large-scale precedence constrained problems
- Tight and Compact Sample Average Approximation for Joint Chance-Constrained Problems with Applications to Optimal Power Flow
This page was built for publication: Adaptive partitioning for chance-constrained problems with finite support
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7013926)
