The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Hospital Layout as a Quadratic Assignment Problem
Abstract
The problem of locating hospital departments so as to minimize the total distance travelled by patients can be formulated as a Quadratic Assignment Problem. In this paper we discuss some practical considerations of the problem, its formulation, we present a heuristic procedure to solve it and comment on our computational experience with the heuristic.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Assignment Problems and the Location of Economic Activities
Koopmans, T. C., & Beckmann, M. (1957) · Econometrica · doi:10.2307/1907742 · Cited by 2,308
A Heuristic Algorithm and Simulation Approach to Relative Location of Facilities
Armour, G. C., & Buffa, E. S. (1963) · Management Science · doi:10.1287/mnsc.9.2.294 · Cited by 740
The Backboard Wiring Problem: A Placement Algorithm
Steinberg, L. (1961) · SIAM Review · doi:10.1137/1003003 · Cited by 379
Quadratic Assignment Problem Algorithms and the Location of Indivisible Facilities
Hillier, F. S., & Connors, M. M. (1966) · Management Science · doi:10.1287/mnsc.13.1.42 · Cited by 231
Cited by
Ant system: optimization by a colony of cooperating agents
Dorigo, M., Maniezzo, V., & Colorni, A. (1996) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/3477.484436 · Cited by 12,067
The ant system applied to the quadratic assignment problem
Maniezzo, V., & Colorni, A. (1999) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.806935 · Cited by 744
A survey for the quadratic assignment problem
Loiola, E. M., de Abreu, N. M. M., Boaventura-Netto, P. O., Hahn, P., & Querido, T. (2007) · European Journal of Operational Research · doi:10.1016/j.ejor.2005.09.032 · Cited by 741
QAPLIB – A Quadratic Assignment Problem Library
Burkard, R. E., Karisch, S. E., & Rendl, F. (1997) · Journal of Global Optimization · doi:10.1023/a:1008293323270 · Cited by 654
Assignment problems: A golden anniversary survey
Pentico, D. W. (2007) · European Journal of Operational Research · doi:10.1016/j.ejor.2005.09.014 · Cited by 513
Metadata
- Authors
- Elshafei, A. N.
- Venue
- Journal of the Operational Research Society
- Publisher
- Informa UK Limited
- Published
- 1977-04
- Volume
- 28
- Issue
- 1
- Pages
- 167-179
- ISSN
- 0160-5682 (ISSN-L)
- 1476-9360
- OpenAlex
- W1981081845
- Cited by
- 275
- References
- 4
- FWCI
- 9.88
- 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.