Branch and Bound examples

For a minimization problem, at a given branch and bound tree (b&b) node i:
Obtain a lower bound, lbi; (Optional) Obtain a candidate solution and an upper
bound ubi; If (ubi < GLOBAL UB) ... Exercise: Calculate the lower bound at node (
2,-).

Part of the document