The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
The Auction Algorithm for Assignment and Other Network Flow Problems: A Tutorial
Abstract
The auction algorithm is an intuitive method for solving the classical assignment problem. It outperforms substantially its main competitors for important types of problems, both in theory and in practice and is also naturally well suited for parallel computation. I derive the algorithm from first principles, explain its computational properties, and discuss its extensions to transportation and transshipment problems.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Cited by
A Formal Analysis and Taxonomy of Task Allocation in Multi-Robot Systems
Gerkey, B. P., & Matarić, M. J. (2004) · The International Journal of Robotics Research · doi:10.1177/0278364904045564 · Cited by 1,753
Emergent Sensing of Complex Environments by Mobile Animal Groups
Berdahl, A., Torney, C. J., Ioannou, C. C., Faria, J. J., & Couzin, I. D. (2013) · Science · doi:10.1126/science.1225883 · Cited by 542
Zhao, W., Meng, Q., & Chung, P. W. H. (2016) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2015.2418052 · Cited by 270
Metadata
- Authors
- Bertsekas, D. P.
- Venue
- Interfaces
- Published
- 1990-08
- Volume
- 20
- Issue
- 4
- Pages
- 133-149
- ISSN
- 0092-2102 (ISSN-L)
- 1526-551X
- OpenAlex
- W2057265280
- Cited by
- 224
- References
- 1
- FWCI
- 3.41
- 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.