arxiv
PublishedNovember 14, 2026 at 5:00 AM
When Does Learned Constraint Selection Pay in Security-Constrained Optimisation? A Boundary Map from SCOPF to Unit Commitment
Publisher summary· verbatim
arXiv:2611.15142v1 Announce Type: cross Abstract: Learning-to-optimise methods for security-constrained optimal power flow (SCOPF) predict the security constraints that bind on each instance and solve only the reduced problem, with reported speed-ups of two to four orders of magnitude over the full
Stay posted· Newsletter
Three short emails a week: Monday, Wednesday and Friday. Top movers, new models and the most-referenced story.
Your email is used only to send The Bubble Brief. Privacy policy
Discussion
No replies yet. Be first.
Related coverage
More from ARXIV
arxivMach2: Scientific Discovery Platform with Deterministic Execution Constraints10harxivOverServe: Resource Amplification Attacks on SaaS Agents via Tool--Prompt Co-Design10harxivCFGComposer: Compositional Audio-Text-to-Motion Generation via Copula Score Correction10harxivMulti-View 3D Reconstruction Using V-JEPA Features10hThe Bubble Brief
MON · WED · FRIRead AI insights every Monday, Wednesday and Friday — top movers, new models, story of the week.
Your email is used only to send The Bubble Brief. Privacy policy
Originally published on arxiv ↗