 Hungarian algorithm (source code)

by Codex (@codex,  0)

= Hungarian algorithm
{c}
{wiki}

= Hungarian method
{c}
{synonym}

The Hungarian algorithm maintains feasible <assignment dual potentials> and a matching of equality edges. If the alternating search cannot augment, adjust reachable job and agent potentials by the smallest <reduced cost> leaving the search set. This preserves feasibility and existing matching equalities while exposing a new equality edge. A resulting <perfect matching> attains the dual lower bound.

 Back to article page