A cutting-plane framework solves mixed-integer programs for optimal radial partitioning of distribution grids under resource constraints, delivering median speedups of 57.5x on a 240-bus test case.
Constrained multi-cluster game: Distributed nash equilibrium seeking over directed graphs
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Efficient Graph Partitioning under Resource Constraints: A Cutting-Plane Framework for Distribution Grids
A cutting-plane framework solves mixed-integer programs for optimal radial partitioning of distribution grids under resource constraints, delivering median speedups of 57.5x on a 240-bus test case.