“…The BST algorithm takes the following inputs: all DCOPF inputs, the contingency setĠ ∪K, the potential amount of load shed 1 that may be shed following a contingency, denoted by LSĠ ∪K , the time interval between two consecutive line switches, , the minimum desired improvement in LSR percentage between a child node and its parent, ı (say 0.01%), and the maximum number of levels in the BST, H. The BST algorithm comprises three procedures: (1) LSĠ ∪K calculation (as described in [23]); (2) initialization procedure to create the root node and place it in the BFS queue; and (3) the main procedure at every node after it is taken out of the BFS queue.…”