Efficient Graph Partitioning under Resource Constraints: A Cutting-Plane Framework for Distribution Grids

arXiv:2604.27180 · math.OC, cs.SY, eess.SY · Submitted 2026-04-29 · Read on arXiv

math.OC, cs.SY, eess.SY

Submitted: 2026-04-29

Updated: 2026-09-20

Terminology

• Resource Constraints — 6× in this paper · explained in 3 episodes
• Multi-Agent System — 4× in this paper · explained in 5 episodes
• Theoretical Guarantees — 4× in this paper · explained in 2 episodes
• Clustering — 2× in this paper · explained in 2 episodes
• Verification — 2× in this paper · explained in 2 episodes
• Ablation — 1× in this paper · explained in 1 episode
• Ablation study — 1× in this paper · explained in 1 episode
• Accuracy — 1× in this paper · explained in 1 episode
• Adaptive Partitioning — 1× in this paper · explained in 1 episode
• Aggregation — 1× in this paper · explained in 1 episode
• Computational overhead — 1× in this paper · explained in 2 episodes
• Consistency — 1× in this paper · explained in 3 episodes
• Core — 1× in this paper · explained in 2 episodes
• Iterative Refinement — 1× in this paper · explained in 3 episodes
• Los Alamos National Laboratory — 1× in this paper
• Nash Equilibrium — 1× in this paper · explained in 2 episodes
• Objective Function — 1× in this paper · explained in 2 episodes

Related papers

• Lions and Muons: Optimization via Stochastic Frank-Wolfe under Heavy-Tailed Noise
• Adam-HNAG: A Convergent Reformulation of Adam with Accelerated Rate
• Incremental Learning in Mirror Flows
• Online Control via Counterfactual Tracking
• Asynchronous Replanning in Two Population Linear Quadratic Mean Field Games: Information Requirements and Stability
• Petrov-Galerkin operator inference with application to stability-encouraging identification