Greedy Heuristic for Solving the Set Covering Problem

This video presented by Jen Pazour is part of the course ISYE 4210 Design and Analysis of Supply Chains taught at Rensselaer Polytechnic Institute. More details about Jen's teaching and research interests can be found here: jenpazour.word...

[@javi1426]

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

[@ridhomuhammadrasyid636]

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

[@javieritofernandinho4424]

i love you, thanks from Chile

[@yashaswinigargav7732]

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

[@stephentomasin4451]

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?

[@yorgundemokrat4615]

thank you...

[@kinjalparihar]

Thank you tonssss!!

[@Fantapew]

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

[@kinjalparihar]

Yes, greedy heuristic approach