{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:05:47Z","timestamp":1761620747446},"reference-count":14,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,7,1]],"date-time":"2001-07-01T00:00:00Z","timestamp":993945600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4399,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2001,7]]},"DOI":"10.1016\/s0304-3975(00)00239-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:59:17Z","timestamp":1027594757000},"page":"159-172","source":"Crossref","is-referenced-by-count":40,"title":["On the landscape ruggedness of the quadratic assignment problem"],"prefix":"10.1016","volume":"263","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":"78","reference":[{"key":"10.1016\/S0304-3975(00)00239-5_BIB1","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/S0304-3975(97)00176-X","article-title":"Autocorrelation coefficient for the graph bipartitioning problem","volume":"191","author":"Angel","year":"1998","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00239-5_BIB2","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/S0166-218X(97)00129-7","article-title":"On the quality of local search for the quadratic assignment problem","volume":"82","author":"Angel","year":"1998","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0304-3975(00)00239-5_BIB3","first-page":"289","article-title":"Binary sequences with a maximally flat amplitude spectrum","volume":"40","author":"Beenker","year":"1985","journal-title":"Philips J. Res."},{"key":"10.1016\/S0304-3975(00)00239-5_BIB4","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0377-2217(90)90301-Q","article-title":"An improved annealing scheme for the qap","volume":"46","author":"Connolly","year":"1990","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0304-3975(00)00239-5_BIB5","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1016\/0377-2217(93)E0128-K","article-title":"Algodesk","volume":"81","author":"Dorigo","year":"1995","journal-title":"European J. Oper. Res"},{"key":"10.1016\/S0304-3975(00)00239-5_BIB6","series-title":"Computers and Intractability \u2013 a Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0304-3975(00)00239-5_BIB7","doi-asserted-by":"crossref","unstructured":"D.S. Johnson, Local optimization and the traveling salesman problem, ICALP 90 Automata, Languages and Programming, 1990, pp. 446\u2013461.","DOI":"10.1007\/BFb0032050"},{"issue":"6","key":"10.1016\/S0304-3975(00)00239-5_BIB8","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1287\/opre.37.6.865","article-title":"Optimization by simulated annealing: an experimental evaluation; part I, graph partitioning","volume":"37","author":"Johnson","year":"1989","journal-title":"Oper. Res."},{"key":"10.1016\/S0304-3975(00)00239-5_BIB9","doi-asserted-by":"crossref","first-page":"53","DOI":"10.2307\/1907742","article-title":"Assigment problems and the location of economic activities","volume":"25","author":"Koopmans","year":"1957","journal-title":"Econometrica"},{"key":"10.1016\/S0304-3975(00)00239-5_BIB10","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/BF00253805","article-title":"Generating quadratic assignment test problems with known optimal permutations","volume":"1","author":"Li","year":"1992","journal-title":"Comput. Optim. Appl."},{"key":"10.1016\/S0304-3975(00)00239-5_BIB11","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1145\/321958.321975","article-title":"P-complete approximation problems","volume":"23","author":"Sahni","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(00)00239-5_BIB12","series-title":"Landscapes and their correlation functions Tech. Rep. 95-07-067","author":"Stadler","year":"1995"},{"key":"10.1016\/S0304-3975(00)00239-5_BIB13","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0966-8349(95)00008-6","article-title":"Comparison of iterative searches for the quadratic assignment problem","volume":"3","author":"Taillard","year":"1995","journal-title":"Location Sci."},{"key":"10.1016\/S0304-3975(00)00239-5_BIB14","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF00202749","article-title":"Correlated and uncorrelated fitness landscapes and how to tell the difference","volume":"63","author":"Weinberger","year":"1990","journal-title":"Biol. Cybernet."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500002395?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500002395?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T04:48:02Z","timestamp":1578458882000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500002395"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,7]]},"references-count":14,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,7]]}},"alternative-id":["S0304397500002395"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00239-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,7]]}}}