Assignment problems and the Hungarian algorithm for minimum cost

What this note covers

1. What an assignment problem is
2. The algorithm, exactly as the outline sets it out
3. A worked 4 x 4 minimisation: rows, then columns
4. Covering the zeros and reducing again
5. Reading off the optimal assignment and stating the answer
6. Setting out the work so it earns full marks
7. How this is examined in the SACE paper and what separates a top answer

7 sections · 12 key terms & formulas · 6 common mistakes