Scenario Grouping and Decomposition Algorithms for Chance-Constrained Programs
From MaRDI portal
Publication:4995100
DOI10.1287/ijoc.2020.0970OpenAlexW3092880077MaRDI QIDQ4995100
No author found.
Publication date: 23 June 2021
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://www.osti.gov/biblio/1735791
mixed integer programmingchance-constrained programmingbranch-and-cutscenario decompositionscenario groupingquantile bounds
Related Items
Chance-Constrained Multiple Bin Packing Problem with an Application to Operating Room Planning, Lagrange dual bound computation for stochastic service network design
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Obtaining lower bounds from the progressive hedging algorithm for stochastic mixed-integer programs
- Decomposition algorithms for optimizing multi-server appointment scheduling with chance constraints
- Scenario grouping in a progressive hedging-based meta-heuristic for stochastic network design
- Scenario cluster decomposition of the Lagrangian dual in two-stage stochastic mixed 0-1 optimization
- A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support
- Nonanticipative duality, relaxations, and formulations for chance-constrained stochastic programs
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- An integer programming approach for linear programs with probabilistic constraints
- NP-hardness of Euclidean sum-of-squares clustering
- Sample average approximation method for chance constrained programming: Theory and applications
- Dual decomposition in stochastic integer programming
- Duality gaps in nonconvex stochastic optimization
- Solving 0-1 semidefinite programs for distributionally robust allocation of surgery blocks
- Scenario decomposition of risk-averse multistage stochastic programming problems
- On mixing sets arising in chance-constrained programming
- A scenario decomposition algorithm for 0-1 stochastic programs
- Scalable Heuristics for a Class of Chance-Constrained Stochastic Programs
- Chance-Constrained Binary Packing Problems
- Covering Linear Programming with Violations
- Risk-Averse Two-Stage Stochastic Linear Programming: Modeling and Decomposition
- Expectation and Chance-Constrained Models and Algorithms for Insuring Critical Paths
- Scenarios and Policy Aggregation in Optimization Under Uncertainty
- Optimization-Driven Scenario Grouping
- A Sample Approximation Approach for Optimization with Probabilistic Constraints
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Least squares quantization in PCM
- Parallel Scenario Decomposition of Risk-Averse 0-1 Stochastic Programs
- Chance-Constrained Surgery Planning Under Conditions of Limited and Ambiguous Data
- Paths, Trees, and Flowers
