The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
A Review of the Placement and Quadratic Assignment Problems
Abstract
The physical design of a computer requires the placement of logic packages which must be interconnected to form a backplane. In this paper' the placement problem is explored and a survey of algorithms is presented for the attack of it and the associated quadratic assignment problem. Also presented are known experimental results of the algorithms defined, conclusions and areas for future research. Although the problem of placement of modules has been emphasized, the techniques are useful for handling the general problem of finding optimal locations for a set of objects that must be interconnected.
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
Static scheduling algorithms for allocating directed task graphs to multiprocessors
Kwok, Y.-K., & Ahmad, I. (1999) · ACM Computing Surveys · doi:10.1145/344588.344618 · Cited by 1,314
A genetic approach to the quadratic assignment problem
Tate, D. M., & Smith, A. E. (1995) · Computers & Operations Research · doi:10.1016/0305-0548(93)e0020-t · Cited by 332
Some Simple Applications of the Travelling Salesman Problem
Lenstra, J. K., & Kan, A. H. G. R. (1975) · Journal of the Operational Research Society · doi:10.1057/jors.1975.151 · Cited by 270
Metadata
- Authors
- Hanan, M., & Kurtzberg, J. M.
- Venue
- SIAM Review
- Published
- 1972-04
- Volume
- 14
- Issue
- 2
- Pages
- 324-342
- ISSN
- 0036-1445 (ISSN-L)
- 1095-7200
- OpenAlex
- W1980129108
- Cited by
- 169
- References
- 1
- FWCI
- 12.05
- 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: A Review of the Placement and Quadratic Assignment Problems. https://app.cochat.ai/papers/10.1137/1014035
- The paper
- Hanan, M., & Kurtzberg, J. M. (1972). A Review of the Placement and Quadratic Assignment Problems. SIAM Review. https://doi.org/10.1137/1014035
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.
