Hungarian algorithm - Wikipedia

The Hungarian method is a combinatorial optimization algorithm that solves the assignment problem in polynomial time and which anticipated later primal–dual methods. It was developed and published in 1955 by Harold Kuhn, who gave it the name "Hungarian method" because the algorithm was largely based on the earlier works of two Hungarian mathematicians, Dénes Kőnig and Jenő Egerváry.[1][2] However,

[kirakking]

backtrackを使うような場合、こいつで効率的らしいが。

[mooz]

ハンガリアン法．割り当て問題．linear-programming.

[ultraist]

割当問題