Assignment 3(Branch and Bound )
Jatin(2K18/CO/158)
Q1)
LC BRANCH AND BOUND
• In LC branch and bound, the
first node we start exploring is
the one which promises us the
best solution at that moment.,
according to a given cost
function. The strategy of
traversing the search space is
therefore defined by the cost
function.
• For example, in 0/1
Knapsack Problem, using LC
Branch and Bound, the first
child node we will start
exploring will be the one
which offers the maximum
cost out of all.
FIFO BRANCH AND BOUND
• The oldest node in the
queue is used to extend the
branch. This leads to a
breadth-first search, where all
nodes at depth d are visited
first, before any nodes at
depth d+1 are visited.
• In fifo branch and bound,
We start exploring nodes
starting from the first child
node.
2)

BACKTRACKING BRANCH AND BOUND

• An algorithm for finding all • An algorithm for discrete
solutions to some and combinatorial
computational problems, optimization problems and
notably constraint satisfaction mathematical optimization.
problems that incrementally
builds candidates to the
solutions.
• Finds the solution to the • Solves a given problem by
overall issue by finding a dividing it into at least two
solution to the first new restricted subproblems.
subproblem and then
recursively solving other
subproblems based on the
solution of the first issue.
• It traverse tree by DFS (Depth • It may traverse the tree in
First Search). any manner, DFS or BFS.
• It involves feasibility • It involves bounding function
function
• It searches the state space • It completely searches the
tree until it found a solution. state space tree to get
optimal solution.