Greedy Heuristic for Solving the Set Covering Problem

Поділитися
Вставка
  • Опубліковано 23 січ 2025

КОМЕНТАРІ • 11

  • @javi1426
    @javi1426 11 місяців тому

    Thank you very much for this video series. Very interesting and well explained

  • @yashaswinigargav7732
    @yashaswinigargav7732 10 місяців тому

    U r life saver m crying literally ❤❤❤❤❤❤ thankyou thankyou

  • @stephentomasin4451
    @stephentomasin4451 10 місяців тому

    What would happen if I have 6 locations to cover, and after the first iteration comparing cj/dj I obtain two variables xj that are equal in ratio (x1 and x4)? When I set the variables to 1 and get to step 3, i have no more constraints left...does this mean the resulting variables x2, x3, x5, and x6 are equal to zero?

  • @RachelGreen-k7x
    @RachelGreen-k7x 3 місяці тому

    Is that should be one more 0 for the unit?

  • @suonidiserenita
    @suonidiserenita 10 місяців тому

    I love the way you explain, but I still don't get it how does the reduction should be 2x ?
    Thank you

  • @javieritofernandinho4424
    @javieritofernandinho4424 2 роки тому +4

    i love you, thanks from Chile

  • @yorgundemokrat4615
    @yorgundemokrat4615 2 роки тому +1

    thank you...

  • @popnx
    @popnx 3 місяці тому

    thank you so much

  • @Fantapew
    @Fantapew Рік тому

    Can anybody tell me the name of this heuristic? If there is one? I assume greedy heuristic is general term.

  • @kinjalparihar
    @kinjalparihar Рік тому

    Thank you tonssss!!