Assignment problem
= Assignment problem
The assignment problem chooses a one-to-one pairing of jobs and agents minimizing their total cost. Its <minimum-cost flow> formulation puts unit supplies on job vertices and unit demands on agent vertices of a <bipartite graph>. Integral feasible flows are <perfect matchings>.