Graph

Showing 1 result

Share

Maximum Flow and the Linear Assignment Problem

The Hungarian graph algorithm solves the linear assignment problem in polynomial time. By modeling resources (e.g., contractors and available contracts) as a graph, the Hungarian algorithm can be used to efficiently determine an optimum way of allocating resources.

25+ minute readContinue Reading
Dmitri Ivanovich Arkhipov

Dmitri Ivanovich Arkhipov

World-class articles, delivered weekly.

Subscription implies consent to our privacy policy

Join the Toptal® community.