Wow this video is amazing. I was able to immediately follow everything you said and as soon as I asked myself "But what does [...] mean?" You immediately talked about it. Bravo!
@TallysYunes
3 жыл бұрын
Thank you. Happy to hear it was helpful!
@SathanaST
4 жыл бұрын
Thank you for making the video!
@lordbottom12aaaaaa
2 жыл бұрын
Taught me more in a 20 minutes video than my teacher in a whole semester. Either you are an amazing teacher or she's the worst ever or both lol
@TallysYunes
2 жыл бұрын
Haha! Happy to hear the video was helpful!
@maroofmaroof3799
4 жыл бұрын
@Tally Yunes dear Sir thank you for explaining so well.I have to solve similar kind of problem with some additional constraint in that but I am not sure if I modeled it right or wrong.Can you kindly help?
@TallysYunes
4 жыл бұрын
Please explain the constraint in words and write down the mathematical expression you used for it.
@sumayaabdulrahman471
11 ай бұрын
Thank you so much for explaining, based on your previous video in the playlist i was thinking if we have an additional constraint that if i select the neighbourhood (x) then the adjacent neighbours to x cannot be selected, so then I'll have to place fire stations in neighbourhood such the neighbourhoods that are adjacent to it are not selected, so how can i add this constraint here as a mathematical formulation ?
@TallysYunes
11 ай бұрын
If I understand your question correctly, you replace the symbol >= with = so that exactly 1 neighborhood is chosen and all the other adjacent ones can't be chosen.
@sumayaabdulrahman471
11 ай бұрын
@@TallysYunes oh Thank you, if change the equality sign from>= to = it is not providing any solution to me :(
@sumayaabdulrahman471
11 ай бұрын
for example, one of the solutions can be neighbourhoods 1,8,6 as these are not adjacent neighbourhoods and at the same tile 1,8,6 cover all their adjacent neighbourhoods too, that is basically what my question is to choose neighbourhoods to place fire station that are not adjacent to each other but at the same time cover all neighbourhoods too, i hope you understand my question
@TallysYunes
11 ай бұрын
Ah, OK. NOW I understand what you were asking. Then bring all the original constraints back to >= 1 and, for every pair of neighborhoods that are adjacent, add a new constraint saying at most one of them can be = 1. So for example, because 1 and 2 are adjacent, you add the constraint x1 + x2
@myunglam648
3 жыл бұрын
Hi can u solve nearest greedy method like nearest insertion and nearest neigbour in travelling salesman
@TallysYunes
3 жыл бұрын
Although one could type in the table of distances between cities in Excel and use Excel to help with the calculations necessary to find the nearest neighbor and nearest insertion, I don't think Excel would be the ideal platform for this. You're probably better off implementing this in a programming language. The algorithms themselves are simple to understand and code.
Пікірлер: 14