The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Variants of the hungarian method for assignment problems
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Hungarian method for the assignment problem
Kuhn, H. W. (1955) · Naval Research Logistics Quarterly · doi:10.1002/nav.3800020109 · Cited by 13,120
Self-citationAlgorithms for the Assignment and Transportation Problems
Munkres, J. (1957) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0105003 · Cited by 3,986
The Traveling-Salesman Problem
Flood, M. M. (1956) · Operations Research · doi:10.1287/opre.4.1.61 · Cited by 682
A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem
Ford, L. R., & Fulkerson, D. R. (1957) · Canadian Journal of Mathematics · doi:10.4153/cjm-1957-024-0 · Cited by 286
An Algorithm for Distinct Representatives
Hall, M. (1956) · American Mathematical Monthly · doi:10.2307/2309562 · Cited by 90
Cited by
Faster Scaling Algorithms for Network Problems
Gabow, H. N., & Tarjan, R. E. (1989) · SIAM Journal on Computing · doi:10.1137/0218069 · Cited by 414
Data structures for weighted matching and nearest common ancestors with linking
Gabow, H. N. (1990) · Symposium on Discrete Algorithms · doi:10.5555/320176.320229 · Cited by 398
Metadata
- Authors
- Kuhn, H. W.
- Venue
- Naval Research Logistics Quarterly
- Publisher
- Wiley
- Published
- 1956-12
- Volume
- 3
- Issue
- 4
- Pages
- 253-258
- ISSN
- 0028-1441 (ISSN-L)
- 1931-9193
- OpenAlex
- W2041670460
- Cited by
- 386
- References
- 5
- FWCI
- 4.16
- Type
- journal article
- Language
- en
- Open access
- closed
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: Variants of the hungarian method for assignment problems. https://app.cochat.ai/papers/10.1002/nav.3800030404
- The paper
- Kuhn, H. W. (1956). Variants of the hungarian method for assignment problems. Naval Research Logistics Quarterly. https://doi.org/10.1002/nav.3800030404
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.
