Cover Image

Advanced Cutting-Plane Algorithms for ACOPF

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bienstock, Daniel, Villagra, Matias
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Accurate Linear Cutting-Plane Relaxations for ACOPF
by: Bienstock, Daniel, et al.
Published: (2023)

Accurate and Warm-Startable Linear Cutting-Plane Relaxations for ACOPF
by: Bienstock, Daniel, et al.
Published: (2024)

A Linear and Scalable Cutting-Plane Algorithm for Electricity Pricing
by: Romero, Matías, et al.
Published: (2025)

De-risking solutions to optimization problems
by: Bienstock, Daniel, et al.
Published: (2026)

A Dynamic Relaxation Framework for Global Solution of ACOPF
by: Tang, Yu-Yang, et al.
Published: (2025)

Synergizing Machine Learning with ACOPF: A Comprehensive Overview
by: Zhao, Meng, et al.
Published: (2024)

Probabilistic Modeling versus Robust Optimization: A tutorial based on a humanitarian logistics use case
by: Kilb, Justin, et al.
Published: (2026)

A Parallelized Cutting-Plane Algorithm for Computationally Efficient Modelling to Generate Alternatives
by: Lau, Michael, et al.
Published: (2025)

Activate the Dual Cones: A Tight Reformulation of Conic ACOPF Constraints
by: Rafiei, Saba, et al.
Published: (2026)

Bucketized Active Sampling for Learning ACOPF
by: Klamkin, Michael, et al.
Published: (2022)

Solving convex QPs with structured sparsity under indicator conditions
by: Bienstock, Daniel, et al.
Published: (2024)

Cutting Planes for Binarized Network Flow Problems
by: Bonami, Pierre, et al.
Published: (2025)

Risk-Aware Security-Constrained Unit Commitment: Taming the Curse of Real-Time Volatility and Consumer Exposure
by: Bienstock, Daniel, et al.
Published: (2023)

Virtual Trading in Multi-Settlement Electricity Markets
by: Capponi, Agostino, et al.
Published: (2025)

Enforcing TSP-Optimality in Fair Vehicle Routing by Cutting Planes
by: van Rossum, Bart, et al.
Published: (2026)

Accelerating Cutting-Plane Algorithms via Reinforcement Learning Surrogates
by: Mana, Kyle, et al.
Published: (2023)

Learning to Select Cutting Planes in Mixed Integer Linear Programming Solving
by: Zhang, Xuefeng, et al.
Published: (2024)

Efficient Graph Partitioning under Resource Constraints: A Cutting-Plane Framework for Distribution Grids
by: Nguyen, Duong Thuy Anh, et al.
Published: (2026)

Linear Programming Hierarchies Collapse under Symmetry
by: Faenza, Yuri, et al.
Published: (2025)

Data Clustering and Visualization with Recursive Max k-Cut Algorithm
by: Ly, An, et al.
Published: (2024)

Active Learning of Deep Neural Networks via Gradient-Free Cutting Planes
by: Zhang, Erica, et al.
Published: (2024)

Progressive Bound Strengthening via Doubly Nonnegative Cutting Planes for Nonconvex Quadratic Programs
by: Qu, Zheng, et al.
Published: (2025)

Learning Cuts via Enumeration Oracles
by: Thuerck, Daniel, et al.
Published: (2023)

Scalable Neural Network Verification with Branch-and-bound Inferred Cutting Planes
by: Zhou, Duo, et al.
Published: (2024)

A Semidefinite Programming-Based Branch-and-Cut Algorithm for Biclustering
by: Sudoso, Antonio M.
Published: (2024)

Deepest Cuts for Benders Decomposition
by: Hosseini, Mojtaba, et al.
Published: (2021)

Data Clustering and Visualization with Recursive Goemans-Williamson MaxCut Algorithm
by: Ly, An, et al.
Published: (2024)

A Cutting-plane and Benders' Decomposition Algorithm for Two-Stage Distributionally Robust Convex programs
by: Luo, Fengqiao, et al.
Published: (2021)

Relax-and-Cut for Temporal SCUC Decomposition
by: Xiong, Jinxin, et al.
Published: (2025)

Theoretical Challenges in Learning for Branch-and-Cut
by: Cheng, Hongyu, et al.
Published: (2026)

Sparse Cuts for the Positive Semidefinite Cone
by: Günlük, Oktay, et al.
Published: (2026)

New Sequence-Independent Lifting Techniques for Cutting Planes and When They Induce Facets
by: Prasad, Siddharth, et al.
Published: (2024)

Hub location with congestion and time-sensitive demand
by: Domínguez-Bravo, Carmen-Ana, et al.
Published: (2024)

Screening Cut Generation for Sparse Ridge Regression
by: Tan, Haozhe, et al.
Published: (2025)

Sample Complexity of Algorithm Selection Using Neural Networks and Its Applications to Branch-and-Cut
by: Cheng, Hongyu, et al.
Published: (2024)

Cut-based Conflict Analysis in Mixed Integer Programming
by: Mexi, Gioni, et al.
Published: (2024)

One-Dimensional Nonnegative Spline Smoothing via Convex Semi-Infinite Programming with a Cutting-Plane Method
by: Arai, Hiroki, et al.
Published: (2026)

On Approximation of Robust Max-Cut and Related Problems using Randomized Rounding Algorithms
by: Shi, Haoyan, et al.
Published: (2024)

On the ReLU Lagrangian Cuts for Stochastic Mixed Integer Programming
by: Deng, Haoyun, et al.
Published: (2024)

A Branch-and-Cut Algorithm for the Optimal Design of Parking Lots with One-way and Two-way Lanes
by: Thomas, Helen, et al.
Published: (2025)