Convex models of distribution system reconfiguration

We derive new mixed-integer quadratic, quadratically constrained, and second-order cone programming models of distribution system reconfiguration, which are to date the first formulations of the ac problem that have convex, continuous relaxations. Each model can be reliably and efficiently solved to optimality using standard commercial software. In the course of deriving each model, we obtain original quadratically constrained and second-order cone approximations to power flow in radial networks.