Image de couverture de livre

Accurate Linear Cutting-Plane Relaxations for ACOPF

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Bienstock, Daniel, Villagra, Matias
Format:	Preprint
Publié:	2023
Sujets:	Optimization and Control
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Accurate and Warm-Startable Linear Cutting-Plane Relaxations for ACOPF
par: Bienstock, Daniel, et autres
Publié: (2024)

Advanced Cutting-Plane Algorithms for ACOPF
par: Bienstock, Daniel, et autres
Publié: (2025)

A Linear and Scalable Cutting-Plane Algorithm for Electricity Pricing
par: Romero, Matías, et autres
Publié: (2025)

A Dynamic Relaxation Framework for Global Solution of ACOPF
par: Tang, Yu-Yang, et autres
Publié: (2025)

De-risking solutions to optimization problems
par: Bienstock, Daniel, et autres
Publié: (2026)

Learning to Select Cutting Planes in Mixed Integer Linear Programming Solving
par: Zhang, Xuefeng, et autres
Publié: (2024)

Synergizing Machine Learning with ACOPF: A Comprehensive Overview
par: Zhao, Meng, et autres
Publié: (2024)

Probabilistic Modeling versus Robust Optimization: A tutorial based on a humanitarian logistics use case
par: Kilb, Justin, et autres
Publié: (2026)

Linear Programming Hierarchies Collapse under Symmetry
par: Faenza, Yuri, et autres
Publié: (2025)

Activate the Dual Cones: A Tight Reformulation of Conic ACOPF Constraints
par: Rafiei, Saba, et autres
Publié: (2026)

Bucketized Active Sampling for Learning ACOPF
par: Klamkin, Michael, et autres
Publié: (2022)

Relax-and-Cut for Temporal SCUC Decomposition
par: Xiong, Jinxin, et autres
Publié: (2025)

Solving convex QPs with structured sparsity under indicator conditions
par: Bienstock, Daniel, et autres
Publié: (2024)

Cutting Planes for Binarized Network Flow Problems
par: Bonami, Pierre, et autres
Publié: (2025)

Risk-Aware Security-Constrained Unit Commitment: Taming the Curse of Real-Time Volatility and Consumer Exposure
par: Bienstock, Daniel, et autres
Publié: (2023)

Virtual Trading in Multi-Settlement Electricity Markets
par: Capponi, Agostino, et autres
Publié: (2025)

Enforcing TSP-Optimality in Fair Vehicle Routing by Cutting Planes
par: van Rossum, Bart, et autres
Publié: (2026)

Applications of Lifted Nonlinear Cuts to Convex Relaxations of the AC Power Flow Equations
par: Bugosen, Sergio I., et autres
Publié: (2024)

On the Strength of Linear Relaxations in Ordered Optimization
par: Blanco, Víctor, et autres
Publié: (2025)

A Parallelized Cutting-Plane Algorithm for Computationally Efficient Modelling to Generate Alternatives
par: Lau, Michael, et autres
Publié: (2025)

Efficient Graph Partitioning under Resource Constraints: A Cutting-Plane Framework for Distribution Grids
par: Nguyen, Duong Thuy Anh, et autres
Publié: (2026)

ROS: A GNN-based Relax-Optimize-and-Sample Framework for Max-k-Cut Problems
par: Qiu, Yeqing, et autres
Publié: (2024)

Non-Monotonicity of Branching Rules with respect to Linear Relaxations
par: Shah, Prachi, et autres
Publié: (2024)

Tightening QC Relaxations of AC Optimal Power Flow through Improved Linear Convex Envelopes
par: Narimani, Mohammad Rasoul, et autres
Publié: (2023)

Network Relaxations for Discrete Bilevel Optimization under Linear Interactions
par: Lozano, Leonardo, et autres
Publié: (2024)

Dual Acceleration for Minimax Optimization: Linear Convergence Under Relaxed Assumptions
par: Li, Jingwang, et autres
Publié: (2025)

Parametric Disjunctive Cuts for Sequences of Mixed Integer Linear Optimization Problems
par: Kelley, Shannon, et autres
Publié: (2025)

Sufficient A Priori Conditions for the Linear Relaxation of the Energy Storage Scheduling Problem
par: Prat, Eléa, et autres
Publié: (2025)

Active Learning of Deep Neural Networks via Gradient-Free Cutting Planes
par: Zhang, Erica, et autres
Publié: (2024)

Progressive Bound Strengthening via Doubly Nonnegative Cutting Planes for Nonconvex Quadratic Programs
par: Qu, Zheng, et autres
Publié: (2025)

Accelerating Cutting-Plane Algorithms via Reinforcement Learning Surrogates
par: Mana, Kyle, et autres
Publié: (2023)

Learning Cuts via Enumeration Oracles
par: Thuerck, Daniel, et autres
Publié: (2023)

A New Semidefinite Relaxation for Linear and Piecewise-Affine Optimal Control with Time Scaling
par: Yang, Lujie, et autres
Publié: (2025)

Scalable Neural Network Verification with Branch-and-bound Inferred Cutting Planes
par: Zhou, Duo, et autres
Publié: (2024)

MIP Relaxations in Factorable Programming
par: He, Taotao, et autres
Publié: (2023)

Towards Optimal Branching of Linear and Semidefinite Relaxations for Neural Network Robustness Certification
par: Anderson, Brendon G., et autres
Publié: (2021)

Deepest Cuts for Benders Decomposition
par: Hosseini, Mojtaba, et autres
Publié: (2021)

Predicting Accurate Lagrangian Multipliers for Mixed Integer Linear Programs
par: Demelas, Francesco, et autres
Publié: (2023)

Centering ADMM for the Semidefinite Relaxation of the QAP
par: Kanoh, Shin-ichi, et autres
Publié: (2020)

Relaxation methods for pessimistic bilevel optimization
par: Benchouk, Imane, et autres
Publié: (2024)