Optimal assignment: match n workers to n jobs at minimum total cost. Step through the algorithm to see row/column reduction and augmenting path selection.