×
Home Discussions Write at Opengenus IQ
×
  • DSA Cheatsheet
  • HOME
  • Track your progress
  • Deep Learning (FREE)
  • Join our Internship 🎓
  • RANDOM
  • One Liner

branch and bound

A collection of 5 posts

backtracking

Backtracking vs Branch and Bound

In this article, we have compared Backtracking vs Branch and Bound algorithms.

CHEW Chee Keng
Algorithms

0-1 Knapsack problem using Branch and Bound

In this article, we have explored the Branch and Bound algorithm for 0-1 Knapsack problem.

Aravind Mohandas Aravind Mohandas
Algorithms

Branch and Bound Technique

With this article, you have explained the idea of Branch and Bound Technique, types of Branch and Bound Technique and applications of the technique.

Aravind Mohandas Aravind Mohandas
Algorithms

Travelling Salesman Problem using Branch and Bound approach

In this article we have discussed about the travelling salesman problem and the branch and bound method to solve the TSP.

Abhijit Tripathy Abhijit Tripathy
Algorithms

8 Queens Problem using Branch and Bound

In the backtracking approach of solving 8 queens problem, we maintain an 8x8 binary matrix for keeping track of safe cells and update it each time we place a new queen.

Mansi Kathuria
OpenGenus IQ © 2025 All rights reserved â„¢
Contact - Email: team@opengenus.org
Primary Address: JR Shinjuku Miraina Tower, Tokyo, Shinjuku 160-0022, JP
Office #2: Commercial Complex D4, Delhi, Delhi 110017, IN
Top Posts LinkedIn Twitter
Android App
Apply for Internship