Decision 2 AQA 3.5 / 5 based on 2 ratings ? MathematicsNetworks, algorithms and problem solvingA2/A-levelAQA Created by: Abbie KnightCreated on: 03-01-13 17:00 This algorithm minimises to create an optimum matching of tasks to workers, for example Hungarian 1 of 7 The maximum flow through a network cannot...the minimum cut Exceed 2 of 7 This diagram is used in critical path analysis Cascade 3 of 7 In dynamic programming, vertices of a graph are known as ... States 4 of 7 In dynamic programming, edges of a graph are known as ... Actions 5 of 7 What constraints can be assumed in the simplex algorithm Non negativity 6 of 7 The option with the worst outcome which is as good as possible in game theory is the ... Play safe strategy 7 of 7
Comments
No comments have yet been made