The DOI matches its Crossref record.
Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost
Abstract
The Hungarian method gives an efficient algorithm for finding the minimal cost assignment. However, in some cases it may be useful to determine the second minimal assignment (i.e., the best assignment after excluding the minimal cost assignment) and in general the kth minimal assignment for k = 1, 2, …. These things can easily be determined if all the assignments can be arranged as a sequence in increasing order of cost. This paper describes an efficient algorithm for such a ranking of all the assignments. The maximum computational effort required to generate an additional assignment in the sequence is that of solving at most (n − 1) different assignment problems, one each of sizes 2, 3, …, n.
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
Cited by
A Review of Data Fusion Techniques
Castanedo, F. (2013) · The Scientific World Journal · doi:10.1155/2013/704504 · Cited by 1,027
Cox, I. J., & Hingorani, S. L. (1996) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.481539 · Cited by 665
A survey of literature on automated storage and retrieval systems
Roodbergen, K. J., & Vis, I. F. A. (2009) · European Journal of Operational Research · doi:10.1016/j.ejor.2008.01.038 · Cited by 664
Object Detection and Tracking for Autonomous Navigation in Dynamic Environments
Ess, A., Schindler, K., Leibe, B., & Van Gool, L. (2010) · The International Journal of Robotics Research · doi:10.1177/0278364910365417 · Cited by 191
Metadata
- Authors
- Murty, K. G.
- Venue
- Operations Research
- Published
- 1968-06
- Volume
- 16
- Issue
- 3
- Pages
- 682-687
- ISSN
- 0030-364X (ISSN-L)
- 1526-5463
- OpenAlex
- W2011087880
- Cited by
- 552
- References
- 0
- 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.
