# Category Archives: Branch and Bound

## Generate Binary Strings of length N using Branch and Bound

The task is to generate a binary string of length N using branch and bound technique Examples: Input: N = 3 Output: 000 001 010… Read More »

## Backtracking | Introduction

Prerequisites : Recursion Complexity Analysis Backtracking is an algorithmic-technique for solving problems recursively by trying to build a solution incrementally, one piece at a time,… Read More »

## Traveling Salesman Problem using Branch And Bound

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 »

## Job Assignment Problem using Branch And Bound

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 »

## N Queen Problem using Branch And Bound

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 »

## 8 puzzle Problem using Branch And Bound

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 »

## Implementation of 0/1 Knapsack using Branch and Bound

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 »

## 0/1 Knapsack using Branch and Bound

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 »