Presents a MILP-extended GeoSteiner algorithm for dynamic battery network reconfiguration that improves lowest battery levels from 2.7% to 68.6% and cuts reconfiguration cost by 72.2% in 20-terminal simulations.
The Prize Collecting Steiner Tree Problem: Theory and Practice,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
eess.SY 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Optimal Reconfiguration of Distributed Battery Networks Under Connectivity and Energy Constraints
Presents a MILP-extended GeoSteiner algorithm for dynamic battery network reconfiguration that improves lowest battery levels from 2.7% to 68.6% and cuts reconfiguration cost by 72.2% in 20-terminal simulations.