Travelling Salesman Problem | Branch & Bound Technique | Lec 95 | Design & Analysis of Algorithm

[@parshwa_1]

Very good explanation till the end

[@gabbyjacob2222]

We have a to c as 14 too so why didnt we try that?

[@lakshyasingh7074]

Bro then it will look like 4xFour Arm(bcz of constraint listen video carefully) that's why

[@RamuECE]

Constraint: from a to c, b should use

[@MousemouShorts]

Mass Don Mouse

[@Neha1408Kumari]

Thankyou Ma'am
Very Nice explanation

[@Mahnoor_khan_1614]

👍

[@lakshyasingh7074]

Thankyou ma'am 🙏🙏

[@ShraddhaKumbar]

Why contrains says we should visit a to b not a to c

[@abhiseksahu4747]

❤

[@pranamya900]

Thank you so much mam❤

[@amalrosh10]

Ma'am, are you from Kerala?

[@jackfightergaming2646]

It should be that a to b and a to c are both need to explore to find the best solution, what if the a-c has the optimal path than a-b? It doesn't give me enough information for this method on your sample problem.

[@amalrosh10]

Thank you ma'am

[@kirangupta3137]

Thank you ma'am