Branch and bound

  • Mutually exclusive and exhaustive sub-problem of the original problem.
  • Partially solved version of the original problem
  • Smaller problems than original problem.
  • The value of the node’s bound is not better than the best solutions .
  • There is no feasible solutions.
  • A new better solution can be obtained rather than continuing further.
  • FIFO(First-In-First-Out) Search
  • LIFO(Last-In-Last-Out) Search
  • LC(Least Cost Search)
The Branching Mechanism in the Branch-and-Bound Strategy to Solve 0/1 Knapsack Problem
0/1 Knapsack problem solved by Branch-and-Bound Strategy

--

--

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store