General Mathematics · Unit 4 · Networks and decision mathematics 2 · Assigning order and the Hungarian algorithm

Use a bipartite graph and its tabular or matrix form to represent possible assignments for an allocation problem.

Practise this objective

AI-marked practice questions tied to QCAA mark schemes for this exact LO. Free to start.

Start free practice

More in Assigning order and the Hungarian algorithm

Determine the optimum (minimum and maximum) assignment/s for small-scale practical problems by inspection.

Use the Hungarian algorithm (3 × 3 up to 5 × 5 square matrices) to determine the optimum (minimum and maximum) assignment/s for larger practical problems.

All LOs in Assigning order and the Hungarian algorithm Back to full General Mathematics syllabus