Branch and Bound Control

F is a set of indices of edges, initially empty

There is an initial Best-Tree with Best-Cost

LBST-Search(F)

if F is a tree then

if c(F) < Best-Cost then

Best-Tree := F;

Best-Cost := c(F);

else {F is not a tree}

for i = last-index-in(F) + 1 to m do

if not(cycle(F,i)) and m(F,i) < Best-Cost then

F := union(F,i);

LBST-Search(F);