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.
The Assignment Problem is a fundamental problem in combinatorial optimization that involves assigning a set of resources to a set of tasks in such a way that the total cost is minimized (or, in some cases, maximized). It can be represented mathematically and is commonly solved using various optimization techniques.
New to topics? Read the docs here!