The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
QAPLIB – A Quadratic Assignment Problem Library
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
Sarker, B. R. (1991) · European Journal of Operational Research · doi:10.1016/0377-2217(91)90179-y · Cited by 1,284
The Quadratic Assignment Problem
Lawler, E. L. (1963) · Management Science · doi:10.1287/mnsc.9.4.586 · Cited by 964
Robust taboo search for the quadratic assignment problem
Taillard, É. D. (1991) · Parallel Computing · doi:10.1016/s0167-8191(05)80147-4 · Cited by 835
Battiti, R., & Tecchiolli, G. (1994) · ORSA Journal on Computing · doi:10.1287/ijoc.6.2.126 · Cited by 801
Tabu Search Applied to the Quadratic Assignment Problem
Skorin‐Kapov, J. (1990) · INFORMS journal on computing · doi:10.1287/ijoc.2.1.33 · Cited by 458
Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
Gilmore, P. C. (1962) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0110022 · Cited by 448
The Backboard Wiring Problem: A Placement Algorithm
Steinberg, L. (1961) · SIAM Review · doi:10.1137/1003003 · Cited by 379
A thermodynamically motivated simulation procedure for combinatorial optimization problems
Burkard, R. E., & Rendl, F. (1984) · European Journal of Operational Research · doi:10.1016/0377-2217(84)90231-5 · Cited by 345
Self-citationComparison of iterative searches for the quadratic assignment problem
Taillard, É. D. (1995) · Location Science · doi:10.1016/0966-8349(95)00008-6 · Cited by 325
Solving Quadratic Assignment Problems by ‘Simulated Annealing’
Wilhelm, M. R., & Ward, T. L. (1987) · IIE Transactions · doi:10.1080/07408178708975376 · Cited by 315
The quadratic assignment problem: A survey and recent developments
Pardalos, P., Rendl, F., & Wolkowicz, H. (1994) · DIMACS Series in Discrete Mathematics and Theoretical Computer Science · doi:10.1090/dimacs/016/01 · Cited by 294
Self-citationHospital Layout as a Quadratic Assignment Problem
Elshafei, A. N. (1977) · Journal of the Operational Research Society · doi:10.1057/jors.1977.29 · Cited by 275
Semidefinite Programming Relaxations for the Quadratic Assignment Problem
Zhao, Q., Karisch, S. E., Rendl, F., & Wolkowicz, H. (1998) · Journal of Combinatorial Optimization · doi:10.1023/a:1009795911987 · Cited by 236
Self-citationGenetic hybrids for the quadratic assignment problem
Fleurent, C., & Ferland, J. A. (1994) · DIMACS series in discrete mathematics and theoretical computer science · doi:10.1090/dimacs/016/08 · Cited by 228
Krarup, J., & Pruzan, P. M. (1978) · Mathematical Programming Studies · doi:10.1007/bfb0120827 · Cited by 190
Entwurf von Schreibmaschinentastaturen mittels quadratischer Zuordnungsprobleme
Burkard, R. E., & Offermann, J. (1977) · Mathematical Methods of Operations Research · doi:10.1007/bf01918175 · Cited by 97
Self-citation
Cited by
A feasible method for optimization with orthogonality constraints
Wen, Z., & Yin, W. (2013) · Mathematical Programming · doi:10.1007/s10107-012-0584-1 · Cited by 849
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
Chemical-Reaction-Inspired Metaheuristic for Optimization
Lam, A. Y. S., & Li, V. O. K. (2010) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2009.2033580 · Cited by 587
A Path Following Algorithm for the Graph Matching Problem
Zaslavskiy, M., Bach, F., & Vert, J.-P. (2009) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2008.245 · Cited by 385
Interior point methods 25 years later
Gondzio, J. (2012) · European Journal of Operational Research · doi:10.1016/j.ejor.2011.09.017 · Cited by 377
Metadata
- Authors
- Burkard, R. E., Karisch, S. E., & Rendl, F.
- Venue
- Journal of Global Optimization
- Published
- 1997-06
- Volume
- 10
- Issue
- 4
- Pages
- 391-403
- ISSN
- 0925-5001 (ISSN-L)
- 1573-2916
- OpenAlex
- W1503085769
- Cited by
- 654
- References
- 16
- FWCI
- 11.93
- 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.