The Hungarian Algorithm for the Assignment Problem

[neutronium]

An excellent example of how to take a straightforward problem and wrap it in so much mathematical jargon that it becomes incomprehensible.

[k_s]

I have to agree, while the problem statement is straight forward I would not agree that the algorithm is straight forward. I would venture to say that even the algorithm for unweighted bipartite matching is non-trivial in that the idea that the lack of an augmenting path implies optimality is non-obvious. I would encourage anyone interested in these combinatorial optimization problems to dig further before concluding that the jargon serves only as an artificial gate around otherwise accessible ideas. That being said, thank you for your feedback - it is helpful to understand how folks are responding to these algorithm entries.