Operations Research 09F: Traveling Salesman Problem - Hungarian Method

Textbooks:

In this video, I'll talk about how to solve the traveling salesman problem using the Hungarian method.

----------------------------------------

[YongWang]

Hi Guys, please comment and let me know what you think about this Operations Research Open Course. Your feedback is really appreciated. If you enjoy the video, please subscribe and share. All my replies here are only related to the content in my own videos. I am afraid I won't be able to answer other questions. Thanks for your understanding.

[berkayzop]

Finallay a video that contains some REAL english in it. Thanks man.

[yaseenal-wesabi]

Thanks for the gentle explanation, D. Wang!

[swedenontwowheels]

Very well done! Concise, clear and accurate! Loved your videos!

[danielgabrys]

The complexity for this algoritm is still O(n^3) ?

[ritikbilala]

this is the best way I find to solve TSP problem

[machalismos]

nice explanation and easy to follow! Thank you

[wexwexexort]

is this the generalisation of the assignment version? is it guaranteeing optimality for tsp?

[yaminibatra]

Good video understood it in one go!! Thank you

[mamunhowlader]

hello sir, is there any others method by which i can solve it except Hungarian Method and Heuristic nearest neighbor method

[sajadm]

Dr. Wang, Can you tell me about the source you relied on to explain this method? I am waiting for your answer, Thank you for your cooperation with me.


SAJJAD

[Thejacek]

nice explanation but BAD!!! how do you know that you should start form C to D ? You can also start from D to C but nvmd, If I had 2 or more the same amount of penalty which should I pick ?? it is not random for sure!!!