The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Algorithms and codes 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
Cited by
Learning to detect natural image boundaries using local brightness, color, and texture cues
Martin, D. R., Fowlkes, C. C., & Malik, J. (2004) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2004.1273918 · Cited by 2,420
Handbook of Constraint Programming
(2006) · Foundations of Artificial Intelligence · doi:10.1016/s1574-6526(06)x8001-x · Cited by 1,483
The traveling salesman problem: An overview of exact and approximate algorithms
Laporte, G. (1992) · European Journal of Operational Research · doi:10.1016/0377-2217(92)90138-y · Cited by 971
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
RASCAL: Calculation of Graph Similarity using Maximum Common Edge Subgraphs
Raymond, J. W. (2002) · The Computer Journal · doi:10.1093/comjnl/45.6.631 · Cited by 319
A taxonomy for task allocation problems with temporal and ordering constraints
Nunes, E., Manner, M., Mitiche, H., & Gini, M. (2017) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2016.10.008 · Cited by 252
Metrics for measuring distances in configuration spaces
Sadeghi, A., Ghasemi, S. A., Schaefer, B., Mohr, S., Lill, M. A., & Goedecker, S. (2013) · The Journal of Chemical Physics · doi:10.1063/1.4828704 · Cited by 141
Metadata
- Authors
- Carpaneto, G., Martello, S., & Toth, P.
- Venue
- Annals of Operations Research
- Published
- 1988-12
- Volume
- 13
- Issue
- 1
- Pages
- 191-223
- ISSN
- 0254-5330 (ISSN-L)
- 1572-9338
- OpenAlex
- W2028040632
- Cited by
- 162
- References
- 1
- FWCI
- 5.91
- 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.