Extreme Ray Feasibility Cuts for Unit Commitment with Uncertainty
From MaRDI portal
Publication:5085475
DOI10.1287/ijoc.2020.0995zbMath1492.90064OpenAlexW3097478933MaRDI QIDQ5085475
No author found.
Publication date: 27 June 2022
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2020.0995
Mixed integer programming (90C11) Stochastic programming (90C15) Stochastic scheduling theory in operations research (90B36)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A modification of Benders' decomposition algorithm for discrete subproblems: An approach for stochastic programs with integer recourse
- Progressive hedging innovations for a class of stochastic mixed-integer resource allocation problems
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- Large-scale mixed integer programming: Benders-type heuristics
- Partitioning procedures for solving mixed-variables programming problems
- L-shaped decomposition of two-stage stochastic programs with integer recourse
- Dual decomposition in stochastic integer programming
- Stochastic dual dynamic integer programming
- A decomposition approach to the two-stage stochastic unit commitment problem
- On parallelizing dual decomposition in stochastic integer programming
- Solving two-stage robust optimization problems using a column-and-constraint generation method
- Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming
- Two-stage network constrained robust unit commitment problem
- Generalized Benders decomposition
- The Sample Average Approximation Method for Stochastic Discrete Optimization
- Multiarea Stochastic Unit Commitment for High Wind Penetration in a Transmission Constrained Network
- Accelerating Benders Decomposition by Local Branching
- The $N-k$ Problem in Power Grids: New Models, Formulations, and Numerical Experiments
- Disjunctive Decomposition for Two-Stage Stochastic Mixed-Binary Programs with Random Recourse
- Accelerating Benders method using covering cut bundle generation
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
- Stochastic unit commitment problem
- Cutting Planes for Multistage Stochastic Integer Programs
This page was built for publication: Extreme Ray Feasibility Cuts for Unit Commitment with Uncertainty