Home · Unit 4 · Topic 5 · Assigning order and the Hungarian algorithm

Assigning order and the Hungarian algorithm

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.

gm-u4-t5-s2-d3

Interactive

Hungarian algorithm — optimum assignment

explainer

Step through row/column reduction and zero-covering on a cost matrix to find an optimum assignment, with a bipartite matching view.

Open fullscreen →

Request an applet

Describe the interactive you’d like — same inbox as applet feedback, tagged as a request for this syllabus id.