A relax-and-cut temporal decomposition with partially relaxed look-ahead windows and dynamic N-1 cut separation solves SCUC faster than monolithic Gurobi while keeping primal gaps near 1%.
Decomposable formulation of transmission constraints for decentralized power systems optimization,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.OC 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
support 1representative citing papers
citing papers explorer
-
Relax-and-Cut for Temporal SCUC Decomposition
A relax-and-cut temporal decomposition with partially relaxed look-ahead windows and dynamic N-1 cut separation solves SCUC faster than monolithic Gurobi while keeping primal gaps near 1%.