.
Branch and Bound Algorithm
- Each solution is thought to become expressible being an array X[1:n].
- A predictor, known as an approximate cost function CC, is actually thought to possess already been described.
- 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.
- The general Branch and Bound (B&B) algorithm:
.
