The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Improving the Hungarian assignment algorithm
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
Combinatorial optimization: networks and matroids
Lawler, E. L. (2021) · Cited by 3,359
Operations Research -- An Introduction
Unwin, A., & Taha, H. A. (1980) · The Journal of the Operational Research Society · doi:10.2307/2581087 · Cited by 1,561
A new algorithm for the assignment problem
Bertsekas, D. P. (1981) · Mathematical Programming · doi:10.1007/bf01584237 · Cited by 292
Cited by
A Joint Learning and Communications Framework for Federated Learning over Wireless Networks
Chen, M., Yang, Z., Saad, W., Yin, C., Poor, H. V., & Cui, S. (2019) · arXiv · doi:10.48550/arxiv.1909.07972 · Cited by 1,547
A Joint Learning and Communications Framework for Federated Learning Over Wireless Networks
Chen, M., Yang, Z., Saad, W., Yin, C., Poor, H. V., & Cui, S. (2021) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2020.3024629 · Cited by 1,547
A shortest augmenting path algorithm for dense and sparse linear assignment problems
Jonker, R., & Volgenant, A. (1987) · Computing · doi:10.1007/bf02278710 · Cited by 1,230
Self-citationIGD Indicator-Based Evolutionary Algorithm for Many-Objective Optimization Problems
Sun, Y., Yen, G. G., & Yi, Z. (2019) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2018.2791283 · Cited by 519
Multi-level Feature Learning for Contrastive Multi-view Clustering
Xu, J., Tang, H., Ren, Y., Peng, L., Zhu, X., & He, L. (2022) · 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr52688.2022.01558 · Cited by 395
Metadata
- Authors
- Jonker, R., & Volgenant, T.
- Venue
- Operations Research Letters
- Publisher
- Elsevier BV
- Published
- 1986-10
- Volume
- 5
- Issue
- 4
- Pages
- 171-175
- ISSN
- 0167-6377 (ISSN-L)
- OpenAlex
- W2076554191
- Cited by
- 274
- References
- 4
- FWCI
- 1.43
- 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: Improving the Hungarian assignment algorithm. https://app.cochat.ai/papers/10.1016/0167-6377(86)90073-8
- The paper
- Jonker, R., & Volgenant, T. (1986). Improving the Hungarian assignment algorithm. Operations Research Letters. https://doi.org/10.1016/0167-6377(86)90073-8
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.