Branch and Bound
Branch and Bound
Branch and Bound
• 2. It has a bounding function, which goes far beyond the feasibility test as
a mean to prune efficiently the search tree.
• Branch and Bound refers to all state space search methods in which all
children of the E-node are generated before any other live node becomes
the E-node
• Branch and Bound is the generalisation of both graph search strategies,
BFS and D- search.
• A BFS like state space search is called as FIFO
(First in first out) search as the list of live
nodes in a first in first out list (or queue).
• For nodes representing partial solutions, c(x) is the cost of the minimum-
cost node in the subtree with root x.
• a) Row reduction: Take the minimum element from first row, subtract it from all
elements of first row, next take minimum element from the second row and
subtract it from second row. Similarly apply the same procedure for all rows.
• b) Find the sum of elements, which were subtracted from rows.
• c) Apply column reductions for the matrix obtained after row reduction.
• Column reduction: Take the minimum element from first column, subtract it from
all elements of first column, next take minimum element from the second column
and subtract it from second column. Similarly apply the same procedure for all
columns.
• d) Find the sum of elements, which were subtracted from columns.
• e) Obtain the cumulative sum of row wise
reduction and column wise reduction.
• Cumulative reduced sum = Row wise
reduction sum + column wise reduction sum.
• Associate the cumulative reduced sum to the
starting state as lower bound and infinity as
upper bound.