A polynomial-time exact algorithm for the sectionalizing switch allocation problem

doi:10.1016/j.epsr.2025.112016

A polynomial-time exact algorithm for the sectionalizing switch allocation problem

2025-07-28

0

PRE

AI

F

Fábio Luiz Usberti *

J

José Federico Vizcaíno González

DOI：10.1016/j.epsr.2025.112016

Original

Original request for help

Save

Abstract

En 中文

• A polynomial-time exact algorithm is proposed for the switch allocation problem. • The problem is proven to be tractable under radial networks and additive functions. • All 9,995 benchmark instances are solved optimally in seconds. • Significant gains over ILP and prior DP approaches are demonstrated. • Code and datasets are publicly available to ensure reproducibility.

Keywords:

switch allocation

polynomial-time algorithm

radial networks

additive functions

exact optimization

A polynomial-time exact algorithm for the sectionalizing switch allocation problem

Abstract

Journal

Organization