Set Covering Problem

[@sugyeongjo6447]

I love your every lecture! Thank you for detailed formulation!

[@broo740]

thanks. I learned from a research article about it and complemented the material with your videos. Definitely, I will give a big thumb and hit subscribe button.

[@Snowmanver2]

Thank you for this lecture!

[@mustinx]

Thanks for the lecture. I do have a question. Since you have a predetermined number of facilities, isn't this considered as a maximum covering location problem since not all demand nodes are satisfied?

[@muhammadabusyahbmohdsuzaly4210]

what cplex app is this

[@allizwell2773]

Hello teacher, I will write a report with cluster coverage 🙁 he said like a thesis. Sir, I saw you on KZbin and needed your help. Is there a book or PDF? What would be your most urgent suggestion?

[@EmilioF.MontenegroA]

Is not SCP different from LSCTP?

[@Guderian444]

Hello. Please help me with this problem. Consider a set of city districts 𝐼. There is a candidate for building a medical emergency service station in every city district. The cost of building an ambulance station is given by the parameter 𝑓𝑖 and the total budget for building stations throughout the city is 50 million. Furthermore, if a station is built in city district 2, it must not be station built in city district 6. Determine in which city districts to build ambulance stations so that the maximum travel time is minimized. What is the optimal maximum travel time? The cost of building stations in the city district 𝑖 ∈ 𝐼, 𝑓𝑖 are: [32,20,25,30,40,29] The city districts and the driving distances between them are interpreted in the following graph: ( [[ 0, 4, 12, 27, 25, 58], [ 4, 0, 24, 16, 29, 38], [12, 24, 0, 31, 14, 30], [27, 16, 31, 0, 21, 8], [25, 29, 14, 21, 0, 11], [58, 38, 30, 8, 11, 0]]) The right answer is to build stations in districts 2 and 4, and optimal travel time is 24. But how can I solve it with excel or with Python, please, help me.