On the computational complexity of branch and bound search strategies | lit.salon