The Hungarian method for the assignment problem

@article{citeulike:2149700, abstract = {Assuming that numerical scores are available for the performance of each of n persons on each of n jobs, the "assignment problem" is the quest for an assignment of persons to jobs so that the sum of the n scores so obtained is as large as possible. It is shown that ideas latent in the work of two Hungarian mathematicians may be exploited to yield a new method of solving this problem.}, address = {Bryn Mawr College}, author = {Kuhn, H. W. }, citeulike-article-id = {2149700}, doi = {10.1002/nav.3800020109}, journal = {Naval Research Logistics Quarterly}, keywords = {algorithms, graph, optimization}, number = {1-2}, pages = {83--97}, posted-at = {2007-12-20 09:33:47}, priority = {2}, publisher = {Wiley Periodicals, Inc.}, school = {Bryn Mawr College}, title = {The Hungarian method for the assignment problem}, url = {http://dx.doi.org/10.1002/nav.3800020109}, volume = {2}, year = {1955} }

TY - JOUR ID - citeulike:2149700 L3 - citeulike-article-id:2149700 TI - The Hungarian method for the assignment problem JF - Naval Research Logistics Quarterly VL - 2 IS - 1-2 SP - 83 EP - 97 AD - Bryn Mawr College PB - Wiley Periodicals, Inc. N2 - Assuming that numerical scores are available for the performance of each of n persons on each of n jobs, the "assignment problem" is the quest for an assignment of persons to jobs so that the sum of the n scores so obtained is as large as possible. It is shown that ideas latent in the work of two Hungarian mathematicians may be exploited to yield a new method of solving this problem. KW - algorithms KW - graph KW - optimization AU - Kuhn, HW PY - 1955/// UR - http://dx.doi.org/10.1002/nav.3800020109 ER -