assignment problem

(classic problem)

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.

Author: CRC-A

Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.

Entry modified Mon May 16 10:48:55 2005.
HTML page formatted Mon Dec 19 14:07:46 2005.

Cite this as:
Algorithms and Theory of Computation Handbook, CRC Press LLC, 1999, "assignment problem", from Dictionary of Algorithms and Data Structures, Paul E. Black, ed., NIST.
http://www.nist.gov/dads/HTML/assignment.html