An algorithm for solving the assignment problem that is based on the following version of a theorem that was first stated by the Hungarian mathematician König and later generalized by the Hungarian mathematician Egerváry: if Av is a matrix and m is the maximum number of independent zero elements of A,v then m lines can be drawn in the rows and columns of the matrix that contain all the zero elements of A.v (A set of elements of a matrix is said to be independent if no two elements lie in the same row or column.)
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Kluwer Academic Publishers
About this entry
Cite this entry
Gass, S.I., Harris, C.M. (2001). Hungarian method . In: Gass, S.I., Harris, C.M. (eds) Encyclopedia of Operations Research and Management Science. Springer, New York, NY. https://doi.org/10.1007/1-4020-0611-X_428
Download citation
DOI: https://doi.org/10.1007/1-4020-0611-X_428
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-7923-7827-3
Online ISBN: 978-1-4020-0611-1
eBook Packages: Springer Book Archive