# Category Archives: Branch and Bound

## Branch And Bound | Set 6 (Traveling Salesman Problem)October 13, 2016

Given a set of cities and distance between every pair of cities, the problem is to find the shortest possible tour that visits every city… Read More »

## Branch And Bound | Set 4 (Job Assignment Problem)May 22, 2016

Let there be N workers and N jobs. Any worker can be assigned to perform any job, incurring some cost that may vary depending on… Read More »

## Branch and Bound | Set 5 (N Queen Problem)May 21, 2016

The N queens puzzle is the problem of placing N chess queens on an N×N chessboard so that no two queens threaten each other. Thus, a solution requires that no… Read More »

## Branch and Bound | Set 3 (8 puzzle Problem)May 20, 2016

We have introduced Branch and Bound and discussed 0/1 Knapsack problem in below posts. Branch and Bound | Set 1 (Introduction with 0/1 Knapsack) Branch… Read More »

## Branch and Bound | Set 2 (Implementation of 0/1 Knapsack)April 29, 2016

We strongly recommend to refer below post as a prerequisite for this. Branch and Bound | Set 1 (Introduction with 0/1 Knapsack) We discussed different… Read More »

## Branch and Bound | Set 1 (Introduction with 0/1 Knapsack)April 27, 2016

Branch and bound is an algorithm design paradigm which is generally used for solving combinatorial optimization problems. These problems typically exponential in terms of time… Read More »