{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T16:51:40Z","timestamp":1765039900493,"version":"3.40.5"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2002,7,1]],"date-time":"2002-07-01T00:00:00Z","timestamp":1025481600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,7,1]],"date-time":"2002-07-01T00:00:00Z","timestamp":1025481600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Heuristics"],"published-print":{"date-parts":[[2002,7]]},"DOI":"10.1023\/a:1015454612213","type":"journal-article","created":{"date-parts":[[2002,12,28]],"date-time":"2002-12-28T23:44:51Z","timestamp":1041119091000},"page":"399-414","source":"Crossref","is-referenced-by-count":27,"title":["On the Hardness of the Quadratic Assignment Problem with Metaheuristics"],"prefix":"10.1007","volume":"8","author":[{"given":"Eric","family":"Angel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vassilis","family":"Zissimopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"407836_CR1","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/S0304-3975(97)00176-X","volume":"191","author":"E. Angel","year":"1998","unstructured":"Angel, E. and V. Zissimopoulos. (1998). \u201cAutocorrelation Coefficient for the Graph Bipartitioning Problem.\u201d Theoretical Computer Science 191, 229\u2013243.","journal-title":"Theoretical Computer Science"},{"key":"407836_CR2","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/S0166-218X(97)00129-7","volume":"82","author":"E. Angel","year":"1998","unstructured":"Angel, E. and V. Zissimopoulos. (1998). \u201cOn the Quality of Local Search for the Quadratic Assignment Problem.\u201d Discrete Applied Mathematics 82, 15\u201325.","journal-title":"Discrete Applied Mathematics"},{"key":"407836_CR3","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/S0166-218X(99)00138-9","volume":"99","author":"E. Angel","year":"2000","unstructured":"Angel, E. and V. Zissimopoulos. (2000). \u201cOn the Classification of NP-Complete Problems in Terms of their Correlation Coefficient.\u201d Discrete Applied Mathematics 99, 261\u2013277.","journal-title":"Discrete Applied Mathematics"},{"issue":"1\/2","key":"407836_CR4","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/S0304-3975(00)00239-5","volume":"263","author":"E. Angel","year":"2001","unstructured":"Angel, E. and V. Zissimopoulos. (2001). \u201cOn the Landscape Ruggedness of the Quadratic Assignment Problem.\u201d Theoretical Computer Science 263(1\/2), 159\u2013172.","journal-title":"Theoretical Computer Science"},{"key":"407836_CR5","unstructured":"Bachelet, V., P. Preux, and E-G. Talbi. (1996). \u201cParallel Hybrid Meta-Heuristics: Application to the Quadratic Assignment Problem.\u201d Technical Report LIL-96-2, LIFL, Universit\u00e9 des Sciences et Technologies de Lille."},{"key":"407836_CR6","unstructured":"Bachelet, V., P. Preux, and E-G. Talbi. (1997). \u201cThe Landscape of the Quadratic Assignment Problem and Local Search Methods.\u201d In Tenth Meeting of the European Chapter on Combinatorial Optimization. Teneriffe, Canary Islands."},{"key":"407836_CR7","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1287\/mnsc.25.3.280","volume":"25","author":"T.E. Block","year":"1979","unstructured":"Block, T.E. (1979). \u201cOn the Complexity of Facilities Layout Problems.\u201d Management Science 25, 280.","journal-title":"Management Science"},{"key":"407836_CR8","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0166-218X(85)90037-X","volume":"12","author":"R.E. Burkard","year":"1985","unstructured":"Burkard, R.E. and U. Fincke. (1985). \u201cProbabilistic Asymptotic Properties of Some Combinatorial Optimization Problems.\u201d Discrete Applied Mathematics 12, 21\u201329.","journal-title":"Discrete Applied Mathematics"},{"key":"407836_CR9","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1023\/A:1008293323270","volume":"10","author":"R.E. Burkard","year":"1997","unstructured":"Burkard, R.E., S.E. Karisch, and F. Rendl. (1997). \u201cQAPLIB\u2014AQuadratic Assignment Problem Library.\u201d Journal of Global Optimization 10, 391\u2013403. See also at http:\/\/www.imm.dtu.dk\/\u223csk\/qaplib\/.","journal-title":"Journal of Global Optimization"},{"key":"407836_CR10","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0377-2217(90)90301-Q","volume":"46","author":"D.T. Connolly","year":"1990","unstructured":"Connolly, D.T. (1990). \u201cAn Improved Annealing Scheme for the QAP.\u201d European Journal of Operational Research 46, 93\u2013100.","journal-title":"European Journal of Operational Research"},{"key":"407836_CR11","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1016\/0377-2217(93)E0128-K","volume":"81","author":"M. Dorigo","year":"1995","unstructured":"Dorigo, M., V. Maniezzo, and A. Colorni. (1995). Algodesk: An Experimental Comparison of Eight Evolutionary Heuristics for the Quadratic Assignment Problem.\u201d European Journal of Operational Research 81, 188\u2013204.","journal-title":"European Journal of Operational Research"},{"key":"407836_CR12","volume-title":"2nd International Conference on Metaheuristics","author":"C. Fonlupt","year":"1997","unstructured":"Fonlupt, C., D. Robilliard, P. Preux, and E-G. Talbi. (1997). \u201cFitness Landscapes and Performance of Meta-Heuristics.\u201d In 2nd International Conference on Metaheuristics. Sophia-Antipolis, France."},{"key":"407836_CR13","unstructured":"Garey, M.R. and D.S. Johnson. (1979). Computers and Intractability\u2014A Guide to the Theory of NP-Completeness. W.H. Freeman and Company."},{"issue":"1","key":"407836_CR14","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1080\/00207548508904693","volume":"23","author":"W. Herroelen","year":"1985","unstructured":"Herroelen, W. and A. Van Gils. (1985). \u201cOn the Use of Flow Dominance in Complexity Measures for Facility Layout Problems.\u201d International Journal of Production Research 23(1), 97\u2013108.","journal-title":"International Journal of Production Research"},{"issue":"6","key":"407836_CR15","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1287\/opre.37.6.865","volume":"37","author":"D.S. Johnson","year":"1989","unstructured":"Johnson, D.S., C.R. Aragon, L.A. McGeoch, and C. Schevon. (1989). \u201cOptimization by Simulated Annealing: An Experimental Evaluation; part I, Graph Partitioning.\u201d Operations Research 37(6), 865\u2013892.","journal-title":"Operations Research"},{"key":"407836_CR16","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/BF00253805","volume":"1","author":"Y. Li","year":"1992","unstructured":"Li, Y. and P.M. Pardalos. (1992). \u201cGenerating Quadratic Assignment Test Problems with Known Optimal Permutations.\u201d Computational Optimization and Applications 1, 163\u2013184.","journal-title":"Computational Optimization and Applications"},{"key":"407836_CR17","unstructured":"Martin O. (1998). \u201cPropri\u00e9t\u00e9s des solutions engendr\u00e9es par des algorithmes heuristiques: la limite de grande taille.\u201d In Premier Congr\u00e8s de la Soci\u00e9t\u00e9 Fran\u00e7aise de Recherche Op\u00e9rationnelle et Aide `a la D\u00e9cision. Paris, Janvier."},{"key":"407836_CR18","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1090\/dimacs\/016\/13","volume":"16","author":"T. Mautor","year":"1993","unstructured":"Mautor, T. and C. Roucairol. (1993). \u201cDifficulties of Exact Methods for Solving the Quadratic Assignment Problem.\u201d In DIMACS (Series in Discrete Mathematics and Theoretical Computer Science) Workshop, Vol. 16, pp. 263\u2013274.","journal-title":"DIMACS (Series in Discrete Mathematics and Theoretical Computer Science) Workshop"},{"key":"407836_CR19","unstructured":"Merz, P. and B. Freisleben. (1997). \u201cA Genetic Local Search Approach to the Quadratic Assignment Problem.\u201d In Proceedings of the Seventh International Conference on Genetic Algorithms (ICGA'97). East Lansing, USA."},{"key":"407836_CR20","unstructured":"Reidys, C.M. and P.F. Stadler. \u201cCombinatorial Landscapes.\u201d SIAM Review, to appear."},{"key":"407836_CR21","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1145\/321958.321975","volume":"23","author":"S. Sahni","year":"1976","unstructured":"Sahni, S. and T. Gonzalez. (1976). \u201cP-Complete Approximation Problems.\u201d Journal of the ACM 23, 555\u2013565.","journal-title":"Journal of the ACM"},{"issue":"1","key":"407836_CR22","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1137\/S1052623497321523","volume":"20","author":"G.R. Schreiber","year":"1999","unstructured":"Schreiber, G.R. and O. Martin. (1999). \u201cCut Size Statistics of Graph Bisection Heuristics.\u201d SIAM Journal on Optimization 20(1), 231\u2013251.","journal-title":"SIAM Journal on Optimization"},{"key":"407836_CR23","series-title":"Technical Report","volume-title":"\u201cLandscapes and their Correlations Functions","author":"P.F. Stadler","year":"1995","unstructured":"Stadler, P.F. (1995). \u201cLandscapes and their Correlations Functions.\u201d Technical Report 95-07-067, Santa Fe Institute, Santa Fe, NM."},{"key":"407836_CR24","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/S0167-8191(05)80147-4","volume":"17","author":"E.D. Taillard","year":"1991","unstructured":"Taillard, E.D. (1991). \u201cRobust Taboo Search for the QAP.\u201d Parallel Computing 17, 443\u2013455.","journal-title":"Parallel Computing"},{"key":"407836_CR25","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0966-8349(95)00008-6","volume":"3","author":"E.D. Taillard","year":"1995","unstructured":"Taillard, E.D. (1995). \u201cComparison of Iterative Searches for the Quadratic Assignment Problem.\u201d Location Science 3, 87\u2013105.","journal-title":"Location Science"},{"key":"407836_CR26","unstructured":"Taillard, E.D. www.idsia.ch\/\u223ceric."},{"issue":"10","key":"407836_CR27","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1287\/mnsc.12.10.B450","volume":"12","author":"T.E. Vollmann","year":"1966","unstructured":"Vollmann, T.E. and E.S. Buffa. (1966). \u201cThe Facilities Layout Problem in Perspective.\u201d Management Science 12(10), 450\u2013468.","journal-title":"Management Science"},{"key":"407836_CR28","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF00202749","volume":"63","author":"E.D. Weinberger","year":"1990","unstructured":"Weinberger, E.D. (1990). \u201cCorrelated and Uncorrelated Fitness Landscapes and How to Tell the Difference.\u201d Biological Cybernetics 63, 325\u2013336.","journal-title":"Biological Cybernetics"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1015454612213.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1015454612213\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1015454612213.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T11:04:20Z","timestamp":1747652660000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1015454612213"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,7]]},"references-count":28,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2002,7]]}},"alternative-id":["407836"],"URL":"https:\/\/doi.org\/10.1023\/a:1015454612213","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"type":"print","value":"1381-1231"},{"type":"electronic","value":"1572-9397"}],"subject":[],"published":{"date-parts":[[2002,7]]}}}