Scribd
Upload
15 views9 pages

BB TSP

Branch and bound is an algorithm design paradigm for solving discrete and combinatorial optimization problems by systematically enumerating candidate solutions represented as a tree. The algorithm explores branches and discards those that cannot yield better solutions than the current best based on estimated bounds. The Traveling Salesman Problem is a specific application of this method, aiming to find the shortest tour visiting each city exactly once and returning to the start.

Uploaded by

rsinglame24
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
15 views9 pages

BB TSP

Branch and bound is an algorithm design paradigm for solving discrete and combinatorial optimization problems by systematically enumerating candidate solutions represented as a tree. The algorithm explores branches and discards those that cannot yield better solutions than the current best based on estimated bounds. The Traveling Salesman Problem is a specific application of this method, aiming to find the shortest tour visiting each city exactly once and returning to the start.

Uploaded by

rsinglame24
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 9

Branch and Bound

• Branch and bound is an algorithm design paradigm for discrete and


combinatoric optimisation problems, as well as mathematical optimisation.

• A branch-and-bound algorithm consists of a systematic enumeration of


candidate solutions. That is, the set of candidate solutions is thought of as
forming a rooted tree with the full set at the root.

• The algorithm explores branches of this tree, which represent the subsets
of the solution set. Before enumerating the candidate solutions of a branch,
the branch is checked against upper and lower estimated bounds on the
optimal solution and is discarded if it cannot produce a better solution than
the best one found so far by the algorithm.
Travelling Salesman Problem
using
Branch and Bound
https://www.youtube.com/watch?v=1FEP_sNb62k&t=672s
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
exactly once and returns to the starting point.

You might also like