Open In App
Related Articles

Branch and Bound Algorithm

Improve
Improve
Improve
Like Article
Like
Save Article
Save
Report issue
Report

The Branch and Bound Algorithm is a method used in combinatorial optimization problems to systematically search for the best solution. It works by dividing the problem into smaller subproblems, or branches, and then eliminating certain branches based on bounds on the optimal solution. This process continues until the best solution is found or all branches have been explored. Branch and Bound is commonly used in problems like the traveling salesman and job scheduling.

Branch and Bound Algorithm

Introduction to Branch and Bound:

Standard Problems on Branch and Bound:

Quick Links:


Last Updated : 22 Feb, 2024
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads