Definition: The problem of finding a maximum (or minimum) weight matching in a weighted, bipartite graph.
Also known as marriage problem.
See also Munkres' assignment algorithm.
Note: From Algorithms and Theory of Computation Handbook, page 7-21, Copyright © 1999 by CRC Press LLC. Appearing in the Dictionary of Computer Science, Engineering and Technology, Copyright © 2000 CRC Press LLC.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 16 May 2005.
HTML page formatted Wed Mar 13 12:42:45 2019.
Cite this as:
Algorithms and Theory of Computation Handbook, CRC Press LLC, 1999, "assignment problem", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 16 May 2005. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/assignment.html