Encyclopedia of Operations Research and Management Science

2001 Edition
| Editors: Saul I. Gass, Carl M. Harris

Hungarian method

  • Saul I. Gass
  • Carl M. Harris
Reference work entry
DOI: https://doi.org/10.1007/1-4020-0611-X_428

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.)

Copyright information

© Kluwer Academic Publishers 2001

Authors and Affiliations

  • Saul I. Gass
    • 1
  • Carl M. Harris
    • 2
  1. 1.Robert H. Smith School of BusinessUniversity of MarylandCollege PartUSA
  2. 2.School of Information Technology & EngineeringGeorge Mason UniversityFairfaxUSA