1
$\begingroup$

I have a question:

In the branch and bound algorithm, if you reach two leaf nodes...do you have to go back and solve all the other problems?

It seems to cumbersome.

1 Answers 1