The DOI matches its Crossref record; 96 of the 96 references it cites were found in a registry or an index.
A survey for the quadratic assignment problem
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
Genetic algorithms in search, optimization, and machine learning
(1989) · Choice Reviews Online · doi:10.5860/choice.27-0936 · Cited by 49,010
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
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
Glover, F. (1990) · ORSA Journal on Computing · doi:10.1287/ijoc.2.1.4 · Cited by 5,647
Glover, F. (1989) · ORSA Journal on Computing · doi:10.1287/ijoc.1.3.190 · Cited by 5,106
Mladenović, N., & Hansen, P. (1997) · Computers & Operations Research · doi:10.1016/s0305-0548(97)00031-2 · Cited by 4,254
Handbook of Evolutionary Computation
(1997) · Institute of Physics eBooks · doi:10.1887/0750308958 · Cited by 2,990
Greedy Randomized Adaptive Search Procedures
Feo, T. A., & Resende, M. G. C. (1995) · Journal of Global Optimization · doi:10.1007/bf01096763 · Cited by 2,778
Hoos (2000) · doi:10.1016/s0167-739x(00)00043-1 · Cited by 2,737
(2003) · Selected Papers of Alan J Hoffman · doi:10.1142/9789812796936_others05 · Cited by 2,465
Greedy Randomized Adaptive Search Procedures
Resende, M. G. C., & Ribeiro, C. C. (2006) · International Series in Operations Research & Management Science · doi:10.1007/0-306-48056-5_8 · Cited by 2,310
Assignment Problems and the Location of Economic Activities
Koopmans, T. C., & Beckmann, M. (1957) · Econometrica · doi:10.2307/1907742 · Cited by 2,308
Corne, D., Dorigo, M., Glover, F., Dasgupta, D., Moscato, P., Poli, R., & Price, K. V. (1999) · Cited by 2,136
Genetic Algorithms and Simulated Annealing
Davis, L. D. (1987) · Cited by 1,759
P-Complete Approximation Problems
Sahni, S., & Gonzalez, T. (1976) · Journal of the ACM · doi:10.1145/321958.321975 · Cited by 1,703
HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS
Glover, F. (1977) · Decision Sciences · doi:10.1111/j.1540-5915.1977.tb01074.x · Cited by 1,363
Sarker, B. R. (1991) · European Journal of Operational Research · doi:10.1016/0377-2217(91)90179-y · Cited by 1,284
Handbook of Combinatorial Optimization
(1999) · Springer eBooks · doi:10.1007/978-1-4757-3023-4 · Cited by 1,216
A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
Padberg, M., & Rinaldi, G. (1991) · SIAM Review · doi:10.1137/1033004 · Cited by 1,097
Facility Layout and Location: An Analytical Approach
Francis, R. L., McGinnis, L. F., & White, J. A. (1991) · Medical Entomology and Zoology · Cited by 1,088
Predicting with networks: Nonparametric multiple regression analysis of dyadic data
Krackhardt, D. (1988) · Social Networks · doi:10.1016/0378-8733(88)90004-4 · Cited by 1,053
Cones of Matrices and Set-Functions and 0–1 Optimization
Lovász, L., & Schrijver, A. (1991) · SIAM Journal on Optimization · doi:10.1137/0801013 · Cited by 1,008
The Quadratic Assignment Problem
Lawler, E. L. (1963) · Management Science · doi:10.1287/mnsc.9.4.586 · Cited by 964
Congruent Graphs and the Connectivity of Graphs
Whitney, H. (1932) · American Journal of Mathematics · doi:10.2307/2371086 · Cited by 863
Robust taboo search for the quadratic assignment problem
Taillard, É. D. (1991) · Parallel Computing · doi:10.1016/s0167-8191(05)80147-4 · Cited by 835
QUADRATIC ASSIGNMENT AS A GENERAL DATA ANALYSIS STRATEGY
Hubert, L., & Schultz, J. (1976) · British Journal of Mathematical and Statistical Psychology · doi:10.1111/j.2044-8317.1976.tb00714.x · Cited by 829
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 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
Ant colonies for the quadratic assignment problem
Gambardella, L. M., Taillard, É. D., & Dorigo, M. (1999) · Journal of the Operational Research Society · doi:10.1057/palgrave.jors.2600676 · Cited by 704
Metaheuristics: A bibliography
Osman, I. H., & Laporte, G. (1996) · Annals of Operations Research · doi:10.1007/bf02125421 · Cited by 672
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
Proceedings of the 5th International Conference on Genetic Algorithms
Forrest, S. (1993) · Cited by 609
A reformulation-linearization technique for solving discrete and continuous nonconvex problems
(1999) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(99)91233-6 · Cited by 591
Handbook of semidefinite programming : theory, algorithms, and applications
Wolkowicz, H., Saigal, R., & Vandenberghe, L. (2000) · Cited by 568
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
Fitness landscape analysis and memetic algorithms for the quadratic assignment problem
Freisleben, B., & Merz, P. (2000) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.887234 · Cited by 423
An improved annealing scheme for the QAP
Connolly, D. T. (1990) · European Journal of Operational Research · doi:10.1016/0377-2217(90)90301-q · Cited by 400
Annotated Bibliographies in Combinatorial Optimization.
Wilson, J. M., Dell’Amico, M., Maffioli, F., & Martello, S. (1998) · Journal of the Operational Research Society · doi:10.2307/3010676 · Cited by 394
The Backboard Wiring Problem: A Placement Algorithm
Steinberg, L. (1961) · SIAM Review · doi:10.1137/1003003 · Cited by 379
Burkard, R. E. (1984) · European Journal of Operational Research · doi:10.1016/0377-2217(84)90093-6 · Cited by 378
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
QAPLIB-A quadratic assignment problem library
Burkard, R. E., Karisch, S., & Rendl, F. (1991) · European Journal of Operational Research · doi:10.1016/0377-2217(91)90197-4 · Cited by 332
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
Comparison 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
Heuristics from nature for hard combinatorial optimization problems
Colorni, A. (1996) · International Transactions in Operational Research · doi:10.1016/0969-6016(96)00004-4 · Cited by 288
Hospital 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
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
ACO algorithms for the quadratic assignment problem
Stützle, T., & Dorigo, M. (1999) · Cited by 262
A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
Adams, W. P., & Sherali, H. D. (1986) · Management Science · doi:10.1287/mnsc.32.10.1274 · Cited by 255
Poore, A. B. (1994) · Computational Optimization and Applications · doi:10.1007/bf01299390 · Cited by 243
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
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
Assignment Methods in Combinatorial Data Analysis
Berk, R. H., & Hubert, L. J. (1989) · Technometrics · doi:10.2307/1268845 · Cited by 229
Genetic 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
Adaptive memory programming: A unified view of metaheuristics
Taillard, É. D., Gambardella, L. M., Gendreau, M., & Potvin, J.-Y. (2001) · European Journal of Operational Research · doi:10.1016/s0377-2217(00)00268-x · Cited by 217
Annotated bibliographies in combinatorial optimization
(1998) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(98)90497-7 · Cited by 191
Krarup, J., & Pruzan, P. M. (1978) · Mathematical Programming Studies · doi:10.1007/bfb0120827 · Cited by 190
A New Genetic Algorithm for the Quadratic Assignment Problem
Drezner, Z. (2003) · INFORMS Journal on Computing · doi:10.1287/ijoc.15.3.320.16076 · Cited by 179
An ant colony system for permutation flow-shop sequencing
Ying, K.-C., & Liao, C.-J. (2004) · Computers & Operations Research · doi:10.1016/s0305-0548(03)00038-8 · Cited by 178
Ant colony optimization algorithm to the inter-cell layout problem in cellular manufacturing
Solimanpur, M., Vrat, P., & Shankar, R. (2004) · European Journal of Operational Research · doi:10.1016/s0377-2217(03)00248-0 · Cited by 172
An algorithm for the quadratic assignment problem using Bender's decomposition
Kaufman, L., & Broeckx, F. (1978) · European Journal of Operational Research · doi:10.1016/0377-2217(78)90095-4 · Cited by 172
A Review of the Placement and Quadratic Assignment Problems
Hanan, M., & Kurtzberg, J. M. (1972) · SIAM Review · doi:10.1137/1014035 · Cited by 169
Adaptive Memory Programming: A Unified View of Meta-Heuristics
Taillard, É. D., Gambardella, L. M., Michel Gendreau, A., & Potvin, J. (1998) · doi:10.71910/supsi.7446 · Cited by 164
Fleurent, C., & Glover, F. (1999) · INFORMS journal on computing · doi:10.1287/ijoc.11.2.198 · Cited by 163
Instance Generators and Test Suites for the Multiobjective Quadratic Assignment Problem
Knowles, J. D., & Corne, D. (2003) · Lecture notes in computer science · doi:10.1007/3-540-36970-8_21 · Cited by 152
A hybrid genetic algorithm for the dynamic plant layout problem
Balakrishnan, J., Cheng, C. H., Conway, D., & Lau, C. M. (2003) · International Journal of Production Economics · doi:10.1016/s0925-5273(03)00027-6 · Cited by 151
On the quadratic assignment problem
FRIEZE, A. M., & Yadegar, J. (1983) · Discrete Applied Mathematics · doi:10.1016/0166-218x(83)90018-5 · Cited by 150
Selected topics on assignment problems
Burkard, R. E. (2002) · Discrete Applied Mathematics · doi:10.1016/s0166-218x(01)00343-2 · Cited by 137
A Tabu Search Algorithm for the Quadratic Assignment Problem
Misevičius, A. (2005) · Computational Optimization and Applications · doi:10.1007/s10589-005-4562-x · Cited by 135
Improved Linear Programming-based Lower Bounds for the Quadratic Assignment Proglem.
Adams, W. P., & Johnson, T. (1993) · Cited by 128
Optimizing gate assignments at airport terminals
Haghani, A. E., & Chen, M.-C. (1998) · Transportation Research Part A Policy and Practice · doi:10.1016/s0965-8564(98)00005-6 · Cited by 123
Drezner, Z., Hahn, P. M., & Taillard, É. D. (2005) · Annals of Operations Research · doi:10.1007/s10479-005-3444-z · Cited by 121
Self-citationAn improved hybrid genetic algorithm: new results for the quadratic assignment problem
Misevičius, A. (2004) · Knowledge-Based Systems · doi:10.1016/j.knosys.2004.03.001 · Cited by 118
Forsberg, J. H., Delaney, R. M., Zhao, Q., Harakas, G. N., & Chandran, R. (1995) · Inorganic Chemistry · doi:10.1021/ic00118a018 · Cited by 118
Tabu search and design optimization
Bland, J. A., & Dawson, G. P. (1991) · Computer-Aided Design · doi:10.1016/0010-4485(91)90089-f · Cited by 111
Massively parallel tabu search for the quadratic assignment problem
Chakrapani, J., & Skorin‐Kapov, J. (1993) · Annals of Operations Research · doi:10.1007/bf02022999 · Cited by 105
A hospital facility layout problem finally solved
Hahn, P. M., & Krarup, J. (2001) · Journal of Intelligent Manufacturing · doi:10.1023/a:1012252420779 · Cited by 89
Self-citationAdaptive memories for the Quadratic Assignment Problems
Taillard, É. D., & Gambardella, L. M. (1997) · SUPSI ARIS · doi:10.71910/supsi.7451 · Cited by 85
neko, V. G. D. I., & Woeginger, G. J. (2000) · Mathematical Programming · doi:10.1007/s101070050010 · Cited by 85
A quadratic assignment formulation of the molecular conformation problem
Phillips, A. T., & Rosen, J. B. (1994) · Journal of Global Optimization · doi:10.1007/bf01096724 · Cited by 81
Solving quadratic assignment problems using convex quadratic programming relaxations
Anstreicher, K. M., & Brixius, N. W. (2001) · Optimization methods & software · doi:10.1080/10556780108805828 · Cited by 68
Fischer, I., Gruber, G., Rendl, F., & Sotirov, R. (2005) · Mathematical Programming · doi:10.1007/s10107-005-0661-9 · Cited by 67
(1992) · Discrete Applied Mathematics · doi:10.1016/0166-218x(92)90210-2 · Cited by 56
On the classification of NP-complete problems in terms of their correlation coefficient
Angel, É., & Zissimopoulos, V. (2000) · Discrete Applied Mathematics · doi:10.1016/s0166-218x(99)00138-9 · Cited by 50
Roupin, F. (2004) · Journal of Combinatorial Optimization · doi:10.1007/s10878-004-4838-6 · Cited by 45
Assignment Methods in Combinatorial Data Analysis
Berk, R. H. (1989) · Technometrics · doi:10.1080/00401706.1989.10488541 · Cited by 44
Near Parameter Free Ant Colony Optimisation
Randall, M. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-28646-2_37 · Cited by 38
Constrained neural approaches to quadratic assignment problems
Ishii, S., & Sato, M.-A. (1998) · Neural Networks · doi:10.1016/s0893-6080(98)00077-x · Cited by 32
Strong duality for a trust-region type relaxation of the quadratic assignment problem
Anstreicher, K. M., Chen, X., Wolkowicz, H., & Yuan, Y. X. (1999) · Linear Algebra and its Applications · doi:10.1016/s0024-3795(99)00205-0 · Cited by 31
Combinatorial and Global Optimization
(2002) · Series on applied mathematics · doi:10.1142/9789812778215 · Cited by 27
Parallel genetic algorithms with local search
Huntley, C. L., & Brown, D. E. (1996) · Computers & Operations Research · doi:10.1016/0305-0548(95)00061-5 · Cited by 26
Rossin, D. F., Springer, M. C., & Klein, B. D. (1999) · Computers & Industrial Engineering · doi:10.1016/s0360-8352(99)00153-9 · Cited by 25
Transgenética computacional: uma aplicação ao problema quadrático de alocação
Goldbarg, M. C., & Goldbarg, E. F. G. (2002) · Pesquisa Operacional · doi:10.1590/s0101-74382002000300005 · Cited by 14
Semidefinite Programming Approaches to the Quadratic Assignment Problem
Wolkowicz, H. (2000) · Combinatorial optimization · doi:10.1007/978-1-4757-3155-2_7 · Cited by 13
Cited by
SuperGlue: Learning Feature Matching With Graph Neural Networks
Sarlin, P.-E., DeTone, D., Malisiewicz, T., & Rabinovich, A. (2020) · 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr42600.2020.00499 · Cited by 2,830
Image Matching from Handcrafted to Deep Features: A Survey
Ma, J., Jiang, X., Fan, A., Jiang, J., & Yan, J. (2021) · International Journal of Computer Vision · doi:10.1007/s11263-020-01359-2 · Cited by 990
Improving the Scalability of Data Center Networks with Traffic-aware Virtual Machine Placement
Meng, X., Pappas, V., & Zhang, L. (2010) · 2010 Proceedings IEEE INFOCOM · doi:10.1109/infcom.2010.5461930 · Cited by 935
Computational Optimal Transport
Peyré, G., & Cuturi, M. (2019) · now publishers, Inc. eBooks · doi:10.1561/9781680835519 · Cited by 847
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
Metadata
- Authors
- Loiola, E. M., de Abreu, N. M. M., Boaventura-Netto, P. O., Hahn, P., & Querido, T.
- Venue
- European Journal of Operational Research
- Publisher
- Elsevier BV
- Published
- 2007-01
- Volume
- 176
- Issue
- 2
- Pages
- 657-690
- ISSN
- 0377-2217 (ISSN-L)
- OpenAlex
- W2013603106
- Cited by
- 741
- References
- 96
- FWCI
- 9.96
- 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.