Lec-25 Branch and Bound Algorithms for TSP

  Рет қаралды 142,893

nptelhrd

nptelhrd

Күн бұрын

Пікірлер: 21
@shresthatripathy5450
@shresthatripathy5450 6 жыл бұрын
One of the Greatest Teacher... better to say Greatest GURU. Thank you so much, sir.
@Annsary
@Annsary 14 жыл бұрын
Man I thank you from all my heart to your devoted great effort in creating the best method of teaching. You are really talented. and my prof. really sucks
@Atreyuguy590
@Atreyuguy590 8 жыл бұрын
His handwriting is so good!
@redshirt-scotty
@redshirt-scotty 7 жыл бұрын
solid. best on that method i've seen so far. no complexity analysis though. i'm wondering how it scales. 5 cities, 10, 20, 40?
@arpitamanik
@arpitamanik 14 жыл бұрын
Thanks!! Was really helpful in my exams!!It was vry easy to understand!!Thanks!!
@joricz75
@joricz75 13 жыл бұрын
Great lesson Sir. Would you be so kind as to upload lectures regarding Genetic Algorithms with constraints?. I'm having problems including the constarints in the objective function. Best Regards.
@Avitus1234
@Avitus1234 7 жыл бұрын
Great job, thank you!
@CraigWhite
@CraigWhite 12 жыл бұрын
Great video!
@ocean4dream
@ocean4dream 13 жыл бұрын
VERY GOOD LECTURE! THX!
@quangpham1643
@quangpham1643 8 жыл бұрын
Can you tell me the reason why you have to use the subtraction to the 3rd column when it doesn't have the "0" ? What does that subtraction mean in that situation ?
@alpacino3989
@alpacino3989 7 жыл бұрын
watch this same guy's hungarian method video and then you will understand
@مكتبعيدالقحطانيللتخليصالجمركيم
@مكتبعيدالقحطانيللتخليصالجمركيم 11 жыл бұрын
Thanks alot, but how to construct a paint production model based on the TSP. If u have an idea please let me know.
@faizalibra6252
@faizalibra6252 7 жыл бұрын
Is there more examples? Help?
@pragyasolanki1607
@pragyasolanki1607 11 жыл бұрын
In this while calculating X13=1,, it came 32 for me.. Plzz clear my doubt..
@70sheavyrockfan
@70sheavyrockfan 12 жыл бұрын
thanks! much appreciated!
@mizantednioc
@mizantednioc 8 жыл бұрын
Thank you so much!
@joricz75
@joricz75 13 жыл бұрын
@laxmipillay Ha ha. I thought the same, I wish I have had this video rather than Mr. Gonzalez :-)
@vijayahir7339
@vijayahir7339 11 жыл бұрын
too good
@urieliramlezama
@urieliramlezama 4 жыл бұрын
un Gurú!
@rohitmanocha4167
@rohitmanocha4167 9 жыл бұрын
X portion was not explained properly by you , not a helpful video
Lec-26 Heuristics for TSP
58:08
nptelhrd
Рет қаралды 82 М.
Lec-24 Traveling Salesman Problem(TSP)
58:30
nptelhrd
Рет қаралды 504 М.
Don’t Choose The Wrong Box 😱
00:41
Topper Guild
Рет қаралды 62 МЛН
Mom Hack for Cooking Solo with a Little One! 🍳👶
00:15
5-Minute Crafts HOUSE
Рет қаралды 23 МЛН
1% vs 100% #beatbox #tiktok
01:10
BeatboxJCOP
Рет қаралды 67 МЛН
BAYGUYSTAN | 1 СЕРИЯ | bayGUYS
36:55
bayGUYS
Рет қаралды 1,9 МЛН
5. Search: Optimal, Branch and Bound, A*
48:37
MIT OpenCourseWare
Рет қаралды 258 М.
7.3 Traveling Salesman Problem - Branch and Bound
24:42
Abdul Bari
Рет қаралды 1,9 МЛН
Travelling salesman problem | Branch and bound | Scholarly things
6:26
Scholarly Things
Рет қаралды 127 М.
Mastering Dynamic Programming - How to solve any interview problem (Part 1)
19:41
TSP Approximation Algorithms | Solving the Traveling Salesman Problem
12:46
Programming and Math Tutorials
Рет қаралды 58 М.
How to solve an Integer Linear Programming Problem Using Branch and Bound
16:49
I made maps that show time instead of space
10:44
Václav Volhejn
Рет қаралды 957 М.
Fast Inverse Square Root - A Quake III Algorithm
20:08
Nemean
Рет қаралды 5 МЛН
Lec-28 Chinese Postman Problem
58:23
nptelhrd
Рет қаралды 52 М.
Traveling Salesman Problem | Dynamic Programming | Graph Theory
20:28
Don’t Choose The Wrong Box 😱
00:41
Topper Guild
Рет қаралды 62 МЛН