The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
A new algorithm for the assignment problem
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
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Edmonds, J., & Karp, R. M. (1972) · Journal of the ACM · doi:10.1145/321694.321699 · Cited by 2,528
Cited by
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
Computational Optimal Transport
Peyré, G., & Cuturi, M. (2019) · now publishers, Inc. eBooks · doi:10.1561/9781680835519 · Cited by 847
The auction algorithm: A distributed relaxation method for the assignment problem
Bertsekas, D. P. (1988) · Annals of Operations Research · doi:10.1007/bf02186476 · Cited by 634
Self-citationAuction algorithms for network flow problems: A tutorial introduction
Bertsekas, D. P. (1992) · Computational Optimization and Applications · doi:10.1007/bf00247653 · Cited by 421
Self-citationWasserstein Distributionally Robust Optimization: Theory and Applications in Machine Learning
Kuhn, D., Esfahani, P. M., Nguyen, V. A., & Shafieezadeh-Abadeh, S. (2019) · Operations Research & Management Science in the Age of Analytics · doi:10.1287/educ.2019.0198 · Cited by 342
Group Role Assignment via a Kuhn–Munkres Algorithm-Based Solution
Zhu, H., Zhou, M., & Alkins, R. (2012) · IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans · doi:10.1109/tsmca.2011.2170414 · Cited by 341
Linear Assignment Problems and Extensions
Burkard, R. E., & Çela, E. (1999) · Handbook of Combinatorial Optimization · doi:10.1007/978-1-4757-3023-4_2 · Cited by 330
Walter, T., & Couzin, I. D. (2021) · eLife · doi:10.7554/elife.64000 · Cited by 286
Combining propensity score matching and group-based trajectory analysis in an observational study.
Haviland, A., Nagin, D. S., & Rosenbaum, P. R. (2007) · Psychological Methods · doi:10.1037/1082-989x.12.3.247 · Cited by 282
Improving the Hungarian assignment algorithm
Jonker, R., & Volgenant, T. (1986) · Operations Research Letters · doi:10.1016/0167-6377(86)90073-8 · Cited by 274
Linear-Time Approximation for Maximum Weight Matching
Duan, R., & Pettie, S. (2014) · Journal of the ACM · doi:10.1145/2529989 · Cited by 265
Decentralized Quality of Service Based System for Energy Trading Among Electric Vehicles
Al-Obaidi, A. A., & Farag, H. E. Z. (2022) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2021.3058514 · Cited by 35
Metadata
- Authors
- Bertsekas, D. P.
- Venue
- Mathematical Programming
- Published
- 1981-12
- Volume
- 21
- Issue
- 1
- Pages
- 152-171
- ISSN
- 0025-5610 (ISSN-L)
- 1436-4646
- OpenAlex
- W2057869046
- Cited by
- 292
- References
- 3
- FWCI
- 1.14
- 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
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.