The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
Abstract
Previous article Next article Optimal and Suboptimal Algorithms for the Quadratic Assignment ProblemP. C. GilmoreP. C. Gilmorehttps://doi.org/10.1137/0110022PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout[1] P. C. Gilmore, A solution to the module placement problem, IBM Research Report, RC-430, 1961, April 26 Google Scholar[2] Tjalling C. Koopmans and , Martin Beckmann, Assignment problems and the location of economic activities, Econometrica, 25 (1957), 53–76 MR0089106 0098.12203 CrossrefISIGoogle Scholar[3] H. W. Kuhn, The Hungarian method for the assignment problem, Naval Res. Logist. Quart., 2 (1955), 83–97 MR0075510 0143.41905 CrossrefGoogle Scholar[4] James Munkres, Algorithms for the assignment and transportation problems, J. Soc. Indust. Appl. Math., 5 (1957), 32–38 10.1137/0105003 MR0093429 0131.36604 LinkISIGoogle Scholar[5] M. J. Rossman and , R. J. Twery, Combinatorial programming, Abstract Journal of ORSA (sixth annual meeting), Marwick, Mitchell and Co., Chicago, Also a mimeographed report from Peat Google Scholar[6] Leon Steinberg, The backboard wiring problem: a placement algorithm, SIAM Rev., 3 (1961), 37–50 10.1137/1003003 MR0122657 0097.14703 LinkISIGoogle Scholar Previous article Next article FiguresRelatedReferencesCited byDetails Estimating Bounds for Quadratic Assignment Problems Associated with Hamming and Manhattan Distance Matrices Based on Semidefinite ProgrammingHans Mittelmann and Jiming Peng2 December 2010 | SIAM Journal on Optimization, Vol. 20, No. 6AbstractPDF (251 KB)Solving Lift-and-Project Relaxations of Binary Integer ProgramsSamuel Burer and Dieter Vandenbussche28 July 2006 | SIAM Journal on Optimization, Vol. 16, No. 3AbstractPDF (228 KB)On the SQAP-PolytopeMichael Jünger and Volker Kaibel31 July 2006 | SIAM Journal on Optimization, Vol. 11, No. 2AbstractPDF (228 KB)Implementation of a Variance Reduction-Based Lower Bound in a Branch-and-Bound Algorithm for the Quadratic Assignment ProblemP. M. Pardalos, K. G. Ramakrishnan, M. G. C. Resende, and Y. Li31 July 2006 | SIAM Journal on Optimization, Vol. 7, No. 1AbstractPDF (274 KB)Can Parallel Branch and Bound without Communication Be Effective?Per S. Laursen13 July 2006 | SIAM Journal on Optimization, Vol. 4, No. 2AbstractPDF (1103 KB)A Review of the Placement and Quadratic Assignment ProblemsMaurice Hanan and Jerome M. Kurtzberg18 July 2006 | SIAM Review, Vol. 14, No. 2AbstractPDF (2163 KB)Statistical Properties of the Placement of a GraphW. E. Donath17 February 2012 | SIAM Journal on Applied Mathematics, Vol. 16, No. 2AbstractPDF (1397 KB) Volume 10, Issue 2| 1962Journal of the Society for Industrial and Applied Mathematics History Submitted:07 September 1961Published online:13 July 2006 InformationCopyright © 1962 Society for Industrial and Applied MathematicsPDF Download Article & Publication DataArticle DOI:10.1137/0110022Article page range:pp. 305-313ISSN (print):0368-4245ISSN (online):2168-3484Publisher:Society for Industrial and Applied Mathematics
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
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
Assignment Problems and the Location of Economic Activities
Koopmans, T. C., & Beckmann, M. (1957) · Econometrica · doi:10.2307/1907742 · Cited by 2,308
The Backboard Wiring Problem: A Placement Algorithm
Steinberg, L. (1961) · SIAM Review · doi:10.1137/1003003 · Cited by 379
Cited by
The Quadratic Assignment Problem
Lawler, E. L. (1963) · Management Science · doi:10.1287/mnsc.9.4.586 · Cited by 964
Kammerdiner, A., Gevezes, T., Pasiliao, E., Pitsoulis, L., & Pardalos, P. M. (2013) · Encyclopedia of Operations Research and Management Science · doi:10.1007/978-1-4419-1153-7_1152 · Cited by 273
Metadata
- Authors
- Gilmore, P. C.
- Venue
- Journal of the Society for Industrial and Applied Mathematics
- Published
- 1962-06
- Volume
- 10
- Issue
- 2
- Pages
- 305-313
- ISSN
- 0368-4245 (ISSN-L)
- 2168-3484
- OpenAlex
- W2049299385
- Cited by
- 448
- References
- 4
- FWCI
- 1.86
- 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: Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem. https://app.cochat.ai/papers/10.1137/0110022
- The paper
- Gilmore, P. C. (1962). Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem. Journal of the Society for Industrial and Applied Mathematics. https://doi.org/10.1137/0110022
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.
