Notes on Branch and Bound

• Branch and bound is still an exponential search. To make it work well many efficiencies should be made.

  • Eliminate copy of the partial solution F on the recursive call.
  • Maintain cost of partial solution F and its sequence of minimum degrees to make computation of m(F,i) fast.
  • Use up tree for cycle checking.
  • Reduce use of expensive bounding checks when possible.
  • Add more bounding checks

Previous slide

Back to first slide

View graphic version