Assignment Problem

Given an edge-weighted bipartite graph, find the matching with the lowest sum of edge-weights.

Can be solved efficiently by the Hungarian algorithm.