The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
The Hungarian method for the assignment problem
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.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“This is achieved by coupling two methods well known for their computational efficiency and their accuracy:a Kalman filter [39] to estimate the position of the bounding boxes in current frame from their previous locations; andthe Hungarian algorithm [40] for optimally solving the problem of association between the predictions and the bounding boxes.”
From Edge-Computing Video Analytics for Real-Time Traffic Monitoring in a Smart City (2019) · cites this paper as [40]
In the citing paper
“We show that it significantly outperforms competitive baselines.”
From End-to-End Object Detection with Transformers (2020) · cites this paper as [19]
In the citing paper
“therefore, DETR does not require a heuristic [19] that is often used to align different masks.”
From End-to-End Object Detection with Transformers (2020) · cites this paper as [19]
In the citing paper
“Similarly to the extension of Faster R-CNN [37] to Mask R-CNN [14], DETR can be naturally extended by adding a mask head on top of the decoder outputs. In this section we demonstrate that such a head can be used to produce panoptic segmentation [19] by treating stuff and thing classes in a unified way.”
From End-to-End Object Detection with Transformers (2020) · cites this paper as [19]
Citations
Cites
Hall, P. (1935) · Journal of the London Mathematical Society · doi:10.1112/jlms/s1-10.37.26 · Cited by 1,954
Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre
König, D. (1916) · Mathematische Annalen · doi:10.1007/bf01456961 · Cited by 636
Application of the simplex method to a transportation problem
Dantzig, G. B. (1951) · Medical Entomology and Zoology · Cited by 375
On the Hitchcock distribution problem
Flood, M. M. (1953) · Pacific Journal of Mathematics · doi:10.2140/pjm.1953.3.369 · Cited by 74
Easterfield, T. E. (1946) · Journal of the London Mathematical Society · doi:10.1112/jlms/s1-21.3.219 · Cited by 60
The Problem of Classification of Personnel
Thorndike, R. L. (1950) · Psychometrika · doi:10.1007/bf02289039 · Cited by 58
A personnel assignment problem
Ramanan, P., Deogun, J. S., & Liu, C. L. (1984) · Journal of Algorithms · doi:10.1016/0196-6774(84)90043-9 · Cited by 49
Solution of the Personnel Classification Problem with the Method of Optimal Regions
Dwyer, P. S. (1954) · Psychometrika · doi:10.1007/bf02288990 · Cited by 34
Motzkin, T. S. (1956) · Proceedings of symposia in applied mathematics · doi:10.1090/psapm/006/0090480 · Cited by 22
Research works printed but not linked: 3
- Birkhoff Garrett, 1946, Tres Observaciones sobre el Algebra Lineal, Univ. Nac. Tucumán. Revista, 5, 147
- Votaw D. F., 1952, The Personnel Assignment Problem, Symposium on Linear Inequalities and Programming, SCOOP, 10, 155
- von Neumann J., 1953, A Certain Zero‐sum Two‐Pereon Game Equivalent to the Optimal Assignment Problem, Contributions to the Theory of Games II, Ann. Math. Study, 28, 5
Cited by
End-to-End Object Detection with Transformers
Carion, N., Massa, F., Synnaeve, G., Usunier, N., Kirillov, A., & Zagoruyko, S. (2020) · arXiv · doi:10.48550/arxiv.2005.12872 · Cited by 18,253
End-to-End Object Detection with Transformers
Carion, N., Massa, F., Synnaeve, G., Usunier, N., Kirillov, A., & Zagoruyko, S. (2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-58452-8_13 · Cited by 18,285
Realtime Multi-person 2D Pose Estimation Using Part Affinity Fields
Cao, Z., Simon, T., Wei, S.-E., & Sheikh, Y. (2017) · 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2017.143 · Cited by 7,539
OpenPose: Realtime Multi-Person 2D Pose Estimation Using Part Affinity Fields
Cao, Z., Hidalgo, G., Simon, T., Wei, S.-E., & Sheikh, Y. (2021) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2019.2929257 · Cited by 5,536
Yilmaz, A., Javed, O., & Shah, M. (2006) · ACM Computing Surveys · doi:10.1145/1177352.1177355 · Cited by 4,792
Metadata
- Authors
- Kuhn, H. W.
- Affiliations
- Bryn Mawr College (US)
- Corresponding author
- Kuhn, H. W.
- Venue
- Naval Research Logistics Quarterly
- Publisher
- Wiley
- Published
- 1955-03
- Volume
- 2
- Issue
- 1-2
- Pages
- 83-97
- ISSN
- 0028-1441 (ISSN-L)
- 1931-9193
- OpenAlex
- W2222512263
- Cited by
- 13,120
- References
- 9
- Citations by year
- 2026: 936 · 2025: 1056 · 2024: 1069 · 2023: 1014 · 2022: 898 · 2021: 969 · 2020: 770 · 2019: 723 · 2018: 615 · 2017: 580 · 2016: 539 · 2015: 506 · 2014: 505 · 2013: 409 · 2012: 423
- FWCI
- 32.97
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- Naval Research Logistics Quarterly (publishedVersion)
- Topics
- Social Sciences › Decision Sciences › Management Science and Operations Research › Optimization and Mathematical Programming
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
- Social Sciences › Decision Sciences › Management Science and Operations Research › Scheduling and Timetabling Solutions
- Keywords
- assignment problem, Hungarian algorithm, maximum matching, combinatorial optimization, assignment algorithm
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The Hungarian method for the assignment problem. https://app.cochat.ai/papers/10.1002/nav.3800020109
- The paper
- Kuhn, H. W. (1955). The Hungarian method for the assignment problem. Naval Research Logistics Quarterly. https://doi.org/10.1002/nav.3800020109
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.