The Hungarian method gives an efficient algorithm for finding the minimal cost assignment. However, in some cases it may be useful to determine the second minimal assignment (i.e., the best assignment ...

This is a preview. Log in through your library . Abstract A new bounding procedure for the Quadratic Assignment Problem (QAP) is described which extends the Hungarian method for the Linear Assignment ...

Kinnaird-Heether explained it wasn’t a tough programming challenge. He used the Kuhn-Munkres algorithm, which also is known as the Hungarian algorithm; it’s designed to solve assignment problems.