Decision 2 What you need to know to get the marks. 3.0 / 5 based on 3 ratings ? MathematicsNetworks, algorithms and problem solvingA2/A-levelAll boards Created by: OliviaCreated on: 13-06-12 14:43 How do you minimax a dynamic programming question? Compare the numbers and write down the maximum then use the minimum number in the section for the chosen one. 1 of 6 In the Hungarian algorithm you have to.. Choose the smallest uncovered number. 2 of 6 In most question papers your asked to find the value of the cut. what can you deduce about this value? The maximum flow is less than or equal tothis value 3 of 6 What is the beginning vertex and last vertex called in a network flow diagram Source and Sink 4 of 6 When you need to ad an extra row or column into a table for the hungarian algorithm to be performed you Add a row/column in which every element is equal to the largest element in the table 5 of 6 Optimal value has been reached in a Linear programming tableau when The top row elements are all positive 6 of 6
Comments
No comments have yet been made