Does anyone have the condensed papers for June 13 onwards? Would be greatly appreciated. Anyway, hope everyone is feeling good about this exam, it's been a long exam season but this is the end and hopefully one of the easiest!
Dynamic programming question: A wide load needs moving from one town to another and the driver wants to find the route which allows him to keep the width limit as wide as possible. Is this minimal or maximin? I'm really struggling to get my head around it any help would be really appreciated. https://youtu.be/7fvSAASZwnY This video says its minimax however I think it's maximin.
Dynamic programming question: A wide load needs moving from one town to another and the driver wants to find the route which allows him to keep the width limit as wide as possible. Is this minimal or maximin? I'm really struggling to get my head around it any help would be really appreciated.
I hope the only really tough Q's are dynamic programming and network flows bc I don't like nitty picky Q's where u can lose easy marks lol.but fingers crossed it will be easy due to the D1 paper being pretty easy
Could someone help me with resource smoothing/levelling?So I know you have the earliest starting time, duration and latest finish time. When you're smoothing out the 'blocks' of activities can you ever go passed the LATEST FINISH TIME for an activity? Or do you have to stay within between the earliest and latest time boundary?
Could someone help me with resource smoothing/levelling?So I know you have the earliest starting time, duration and latest finish time. When you're smoothing out the 'blocks' of activities can you ever go passed the LATEST FINISH TIME for an activity? Or do you have to stay within between the earliest and latest time boundary?
I think it has to stay between earlier and latest boundaries, otherwise other activities might get delayed.
Can someone explain how you would prove your maximum flow after completing the labeling procedure? Do you take the cut from the initial network or your new one with max flows? and where the F do you place the cut?? I get its meant to be = Max flow but there are so many flows to check!!! thankyou