Travelling Sales Person - Branch & Bound with Example Part -1 |DAA|

[@Akash-mi2hl]

Mam tomorrow is my exam and now i feel this topic soo easy...our DAA mam said this topic but i was really confusing and by ur video i feel this topic soo easy....thank you so much mam ur videos are making me soo easy to understand each and every topic.....

[@sridevi_06]

Exactly 💯

[@frozenx5424]

i dont have time to watch next part now so iam like abhimanyu now i know how to enter chakravhuham but dont know how to exit😂

[@TroubleFreevideos]

haha, atleast go through it at 2x speed, you can get an idea atleast

[@durgaprasadkumarapu8330]

Is this ok for dynamic programming

[@theaterfeast]

Bro can u answer me is this ok for dynamic programming did u tried

[@sridharsriramadasu9246]

Tq ma'am ❤❤

[@satvika7819]

Describe how the branch and bound method can be applied to solve the Traveling Salesperson Problem (TSP). What challenges arise in applying this method to TSP?

[@kalaivani2479]

Thank you mam

[@NikhilShrivastava-gk5wz]

16 is the total reduction , how it use in place of cost of parent matrix

[@Brother.577]

Supr mam

[@naresh2162]

Thank akka

[@srijapochampalli]

NYC

[@idkbro6425]

why does this work?

[@ssrdasi382]

you took that matrix value randomly right?

[@TroubleFreevideos]

Yes

[@ssrdasi382]

@@TroubleFreevideos there is a rule that DO NOT VISIT ANY CITY MORE THAN ONCE )but while he is going back he is visiting again...

[@pavanboya6546]

In A to D reduction is 4 mam