Branch and Bound Algorithm

  1. Each solution is thought to become expressible being an array X[1:n].
  2. A predictor, known as an approximate cost function CC, is actually thought to possess already been described.
  3. Definitions:

    • A live node is a node which is not been expanded
    • A dead node is a node that`s been expanded
    • The expanded node (or even E-node with regard to short) is the live node with the best CC value.

  4. The general Branch and Bound (B&B) algorithm:

branch and bound algorithm