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

  Рет қаралды 47,689

Trouble- Free

Trouble- Free

Күн бұрын

Abroad Education Channel :
/ @shraavyakatkuri4078
contact me on gmail at : shraavyareddy810@gmail.com
Contact me on instagram at : / shraavya_katkuri

Пікірлер: 15
@Akash-mi2hl
@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
@sridevi_06 2 ай бұрын
Exactly 💯
@naresh2162
@naresh2162 6 ай бұрын
Thank akka
@NikhilShrivastava-gk5wz
@NikhilShrivastava-gk5wz 2 ай бұрын
16 is the total reduction , how it use in place of cost of parent matrix
@Brother.577
@Brother.577 Жыл бұрын
Supr mam
@durgaprasadkumarapu8330
@durgaprasadkumarapu8330 7 ай бұрын
Is this ok for dynamic programming
@theaterfeast
@theaterfeast 5 ай бұрын
Bro can u answer me is this ok for dynamic programming did u tried
@idkbro6425
@idkbro6425 Ай бұрын
why does this work?
@srijapochampalli
@srijapochampalli 10 ай бұрын
NYC
@frozenx5424
@frozenx5424 4 ай бұрын
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
@TroubleFreevideos 4 ай бұрын
haha, atleast go through it at 2x speed, you can get an idea atleast
@pavanboya6546
@pavanboya6546 11 ай бұрын
In A to D reduction is 4 mam
@ssrdasi382
@ssrdasi382 Жыл бұрын
you took that matrix value randomly right?
@TroubleFreevideos
@TroubleFreevideos Жыл бұрын
Yes
@ssrdasi382
@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...
Travelling Sales Person - Branch & Bound with Example Part -2 |DAA|
12:42
I Can't Believe We Did This...
00:38
Stokes Twins
Рет қаралды 86 МЛН
아이스크림으로 체감되는 요즘 물가
00:16
진영민yeongmin
Рет қаралды 36 МЛН
DO YOU HAVE FRIENDS LIKE THIS?
00:17
dednahype
Рет қаралды 84 МЛН
7.3 Traveling Salesman Problem - Branch and Bound
24:42
Abdul Bari
Рет қаралды 1,7 МЛН
COIN ROW PROBLEM
34:03
Pavan Mahendrakar
Рет қаралды 224
NP Hard and NP Complete Problems, Non Deterministic Algorithms |DAA|
10:21
Branch and Bound - Method, Example, Applications|DAA|
20:16
Trouble- Free
Рет қаралды 48 М.
travelling salesman problem|| problem 1
13:19
HAMEEDA MATHTUBER
Рет қаралды 31 М.
4.7 Traveling Salesperson Problem - Dynamic Programming
15:25
Abdul Bari
Рет қаралды 1,5 МЛН
0/1 knapsack problem-Dynamic Programming | Data structures and algorithms
27:31
Jenny's Lectures CS IT
Рет қаралды 1,1 МЛН
I Can't Believe We Did This...
00:38
Stokes Twins
Рет қаралды 86 МЛН