Skip to main content
Book Chapter

The Hungarian method for the assignment problem

Springer Berlin Heidelberg, (2010), 29-47
DOI: 10.1007/978-3-540-68279-0_2
267Citations
Citations of this article
1.1kReaders
Mendeley users who have this article in their library.
Get full text

Abstract

This paper has always been one of my favorite children, combining as it does elements of the duality of linear programming and combinatorial tools from graph theory. It may be of some interest to tell the story of its origin. © 2010 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Kuhn, H. W. (2010). The Hungarian method for the assignment problem. In 50 Years of Integer Programming 1958-2008: From the Early Years to the State-of-the-Art (pp. 29–47). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-68279-0_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free