# Category - Branch and Bound

## Branch And Bound | Set 6 (Traveling Salesman Problem)

Branch And Bound (Traveling Salesman Problem) - Branch And Bound Given a set of cities and distance between every pair of cities, the problem.

## Branch and Bound | Set 5 (N Queen Problem)

Branch and Bound (N Queen Problem)-Branch and Bound The N queens puzzle is the problem of placing N chess queens on an N×N chessboard so.

## Branch And Bound | Set 4 (Job Assignment Problem)

Branch And Bound (Job Assignment Problem) - Branch And Bound - It is required to perform all jobs by assigning exactly one worker to each job.

## Branch and Bound | Set 3 (8 puzzle Problem)

Branch and Bound (8 puzzle Problem) - Branch and Bound - We have introduced Branch and Bound and discussed 0/1 Knapsack problem in below posts.

## Branch and Bound | Set 2 (Implementation of 0/1 Knapsack)

Branch and Bound (Implementation of 0/1 Knapsack)-Branch and Bound The idea is to use the fact that the Greedy approach provides the best solution.

## Branch and Bound | Set 1 (Introduction with 0/1 Knapsack)

Branch and Bound (Introduction with 0/1 Knapsack)-Branch and Bound-Branch and bound is an algorithm design paradigm which is generally used.

## C Programming-Binary representation of a given number

C Programming - Binary representation of a given number - Bit Algorithm - Write a program to print Binary representation of a given number.