How do we OPTIMALLY assign drivers to riders? (Hungarian Algorithm) | Bipartite Matchings

แชร์
ฝัง
  • เผยแพร่เมื่อ 1 ส.ค. 2024

ความคิดเห็น • 11

  • @mehdizahedi2810
    @mehdizahedi2810 28 วันที่ผ่านมา

    Awesome video! You splendidly break down a complex problem into understandable pieces and then aggregate them to get the final result. I would really appreciate it if you could recommend a book chapter or an article tailored for a more mathematically inclined audience.

  • @davidventzke8051
    @davidventzke8051 ปีที่แล้ว

    Great video! Nice introduction of the dual problems.

  • @gagapornis1438
    @gagapornis1438 5 หลายเดือนก่อน

    Beautiful, thank you.

  • @yinyl
    @yinyl ปีที่แล้ว

    Wonderful!

  • @taylorjweidman
    @taylorjweidman ปีที่แล้ว

    I love these videos!

    • @OptWhiz
      @OptWhiz  ปีที่แล้ว

      thanks so much for watching!

  • @Hydra_cody
    @Hydra_cody ปีที่แล้ว

    Thanks'

  • @Tygelin86
    @Tygelin86 ปีที่แล้ว +1

    i aprecieate the effort but this topic is really hard for me. Instead of understand the video i just got sleepy and more depressed as im watching this. My brain is just trying to shut off instead of trying to understand. I think that the reason for this is that how many times i end uo in a situation where to learn some topic there is a preety deep stack of things that i need to learn before i even can learn the topic i wanted. So in some cases as I'm forced to put another thing on the stack i end up learning something and i even don't reamember why i was learning this i dont even remember what is on the bootom of the stack i wanted to learn. And this process never ends.

  • @wChris_
    @wChris_ 6 หลายเดือนก่อน

    How is this actually different from the Travelling Salesman Problem or one of its variants like the Vehicle Routing Problem all of which are NP-hard

    • @OptWhiz
      @OptWhiz  6 หลายเดือนก่อน

      In TSP or VRP, a vehicle may pick up multiple passengers. Here, we're assigning each vehicle to just one passenger.