The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
On implementing 2D rectangular assignment algorithms
Abstract
This paper reviews research into solving the two-dimensional (2D) rectangular assignment problem and combines the best methods to implement a k-best 2D rectangular assignment algorithm with bounded runtime. This paper condenses numerous results as an understanding of the "best" algorithm, a strong polynomial-time algorithm with a low polynomial order (a shortest augmenting path approach), would require assimilating information from many separate papers, each making a small contribution. 2D rectangular assignment Matlab code is provided.
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
A note on two problems in connexion with graphs
Dijkstra, E. W. (1959) · Numerische Mathematik · doi:10.1007/bf01386390 · Cited by 24,043
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: Algorithms and Complexity.
Johnson, D. S., Papadimitriou, C. H., & Steiglitz, K. (1984) · The American Mathematical Monthly · doi:10.2307/2322374 · Cited by 5,942
Parallel and Distributed Computation: Numerical Methods
Bertsekas, D. P., & Tsitsiklis, J. N. (1989) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 5,293
Algorithms 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
Combinatorial optimization:Algorithms and complexity
Rabiner, L. (1984) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1984.1164450 · Cited by 3,576
Design and Analysis of Modern Tracking Systems
Blackman, S. S., & Populi, R. (1999) · Cited by 3,509
Introduction to linear optimization
Bertsimas, D., & Tsitsiklis, J. N. (1997) · Cited by 2,705
Introduction to algorithms [2nd ed.]
Cormen, T. H. (2001) · Cited by 1,911
Burkard, R., Dell'Amico, M., & Martello, S. (2009) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898717754 · Cited by 1,394
Cited by
Enhanced atom-by-atom assembly of arbitrary tweezer arrays
Schymik, K.-N., Lienhard, V., Barredo, D., Scholl, P., Williams, H., Browaeys, A., & Lahaye, T. (2020) · Physical Review A · doi:10.1103/physreva.102.063107 · Cited by 94
Assessment of Nucleic Acid Structure Prediction in CASP16
Kretsch, R. C., Hummer, A. M., He, S., Yuan, R., Zhang, J., Karagianes, T., Cong, Q., Kryshtafovych, A., & Das, R. (2026) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.70072 · Cited by 51
“Further, we generated base pair probability matrices using ViennaRNA, EternaFold, and CONTRAfold, and used a linear-sum assignment algorithm [61] or a ThreshKnot heuristic [62] to generate potentially pseudoknotted structures.”
Design2Code: Benchmarking Multimodal Code Generation for Automated Front-End Engineering
Si, C., Zhang, Y., Li, R., Yang, Z., Liu, R., & Yang, D. (2025) · Proceedings of the 2025 Conference of the Nations of the Americas Chapter of the Association for Computational Linguistics: Human Language Technologies (Volume 1: Long Papers) · doi:10.18653/v1/2025.naacl-long.199 · Cited by 17
“Based on the two sets of detected blocks, we use the Jonker-Volgenant algorithm (Crouse, 2016) to get the optimal matching M between R and G based on text similarity, where ( p, q ) ∈ M indicates r p is matched with g q .”
Design2Code: Benchmarking Multimodal Code Generation for Automated Front-End Engineering
Si, C., Zhang, Y., Li, R., Yang, Z., Liu, R., & Yang, D. (2024) · arXiv · doi:10.48550/arxiv.2403.03163 · Cited by 4
Capturing the physics of MaNGA galaxies with self-supervised Machine Learning
Sarmiento, R., Huertas-Company, M., Knapen, J. H., Sánchez, S. F., Domínguez Sánchez, H., Drory, N., & Falcón-Barroso, J. (2021) · The Astrophysical Journal · doi:10.3847/1538-4357/ac1dac · Cited by 1
Metadata
- Authors
- Crouse, D. F.
- Venue
- IEEE Transactions on Aerospace and Electronic Systems
- Published
- 2016-08
- Volume
- 52
- Issue
- 4
- Pages
- 1679-1696
- ISSN
- 0018-9251 (ISSN-L)
- OpenAlex
- W2557169239
- Cited by
- 405
- References
- 30
- FWCI
- 1.49
- 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: On implementing 2D rectangular assignment algorithms. https://app.cochat.ai/papers/10.1109/taes.2016.140952
- The paper
- Crouse, D. F. (2016). On implementing 2D rectangular assignment algorithms. IEEE Transactions on Aerospace and Electronic Systems. https://doi.org/10.1109/taes.2016.140952
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.