Student or educator? Sign up with your school email and get 6 months of Pro free.

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

Kuhn, H. W.·1955·Naval Research Logistics Quarterly

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

Crossref · 10.1002/nav.3800020109

Cites

9 of 9 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

Citations

Cites

Show all 9 references

Research works printed but not linked: 3

  1. Birkhoff Garrett, 1946, Tres Observaciones sobre el Algebra Lineal, Univ. Nac. Tucumán. Revista, 5, 147
  2. Votaw D. F., 1952, The Personnel Assignment Problem, Symposium on Linear Inequalities and Programming, SCOOP, 10, 155
  3. 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

See all 13,120

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.