{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T10:45:23Z","timestamp":1762339523264},"reference-count":18,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2002,12,1]],"date-time":"2002-12-01T00:00:00Z","timestamp":1038700800000},"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":3881,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2002,12]]},"DOI":"10.1016\/s0166-218x(01)00333-x","type":"journal-article","created":{"date-parts":[[2002,8,26]],"date-time":"2002-08-26T19:45:48Z","timestamp":1030391148000},"page":"103-116","source":"Crossref","is-referenced-by-count":12,"title":["Classes of quadratic assignment problem instances: isomorphism and difficulty measure using a statistical approach"],"prefix":"10.1016","volume":"124","author":[{"given":"Nair Maria","family":"Maia de Abreu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paulo Oswaldo Boaventura","family":"Netto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tania Maia","family":"Querido","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elizabeth Ferreira","family":"Gouvea","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(01)00333-X_BIB1","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/S0166-218X(97)00129-7","article-title":"On the quality of the local search for the quadratic assignment problem","volume":"82","author":"Angel","year":"1998","journal-title":"Discrete Appl. Math."},{"issue":"111","key":"10.1016\/S0166-218X(01)00333-X_BIB2","first-page":"73","article-title":"Automorphismes du permuto\u00e8dre et votes de Condorcet","volume":"28e","author":"Barbut","year":"1990","journal-title":"Math. Inform. Sci. Hum."},{"key":"10.1016\/S0166-218X(01)00333-X_BIB3","unstructured":"P.O. Boaventura-Netto, N.M.M. Abreu, Quadratic assignment problem: a polynomial expression for the variance of solutions (extended abstract), I ELIO\/Optima 97, Concepci\u00f3n, Chile, November 1997."},{"key":"10.1016\/S0166-218X(01)00333-X_BIB4","unstructured":"P.O. Boaventura-Netto, N.M.M. Abreu, Cost solution average and variance in the quadratic assignment problem, Technical Report PEP 02\/98, Programa de Engenharia de Produ\u00e7a\u030bo, COPPE\/URFJ, 1998 (in Portuguese)."},{"key":"10.1016\/S0166-218X(01)00333-X_BIB5","unstructured":"R.E. Burkard, E. \u00c7ela, A.M. Demidenko, N.N. Metelski, G.J. Woeginger, Perspectives of easy and hard cases of the quadratic assignment problem spezialforschungsbereich F003, Optimierung und Kontrolle, Bericht Nr104, Graz, 1997."},{"key":"10.1016\/S0166-218X(01)00333-X_BIB6","unstructured":"R.E. Burkard, S.E. Karisch, F. Rendl, QAPLIB\u2014a quadratic assignment problem libaray, Report No. 287 CDLDO-41, Technische Universitat, Graz, 1994."},{"key":"10.1016\/S0166-218X(01)00333-X_BIB7","doi-asserted-by":"crossref","unstructured":"E. \u00c7ela, The quadratic assignment problem: theory and algorithms, in: Combinatorial Optimization, Kluwer Academic Publishers, Dordrecht, 1998.","DOI":"10.1007\/978-1-4757-2787-6"},{"key":"10.1016\/S0166-218X(01)00333-X_BIB8","series-title":"Annotated Bibliographies in Combinatorial Optimization","author":"Dell'Amico","year":"1997"},{"key":"10.1016\/S0166-218X(01)00333-X_BIB9","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1287\/opre.14.2.210","article-title":"The optimal assignment of facilities to locations by branch-and-bound","volume":"14","author":"Gavett","year":"1966","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(01)00333-X_BIB10","unstructured":"E.F. Gouv\u00eaa, Applications of statistics and algebra to QAP, qualifying examination to D.Sc., Programa de Engenharia de Produ\u00e7a\u030bo, COPPE\/UFRJ, 1999 (in Portuguese)."},{"key":"10.1016\/S0166-218X(01)00333-X_BIB11","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1287\/mnsc.16.7.453","article-title":"An algorithm for the quadratic assignment problem","volume":"17","author":"Graves","year":"1970","journal-title":"Manage. Sci."},{"key":"10.1016\/S0166-218X(01)00333-X_BIB12","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1080\/00207548508904693","article-title":"On the use of flow dominance in complexity measures for facility layout problems","volume":"23","author":"Herroeleven","year":"1985","journal-title":"Internat. J. Prod. Res."},{"issue":"1","key":"10.1016\/S0166-218X(01)00333-X_BIB13","doi-asserted-by":"crossref","first-page":"53","DOI":"10.2307\/1907742","article-title":"Assignment problems and the location of economic activities","volume":"25","author":"Koopmans","year":"1957","journal-title":"Econometrica"},{"key":"10.1016\/S0166-218X(01)00333-X_BIB14","doi-asserted-by":"crossref","unstructured":"T. Mautor, C. Roucairol, Difficulties of exact methods for solving the quadratic assignment problem, in: P. Pardlos, H. Wolkowics (Eds.), Quadratic Assignment and Related Problems, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 16, AMS, Providence, RI, 1994.","DOI":"10.1090\/dimacs\/016\/13"},{"key":"10.1016\/S0166-218X(01)00333-X_BIB15","doi-asserted-by":"crossref","first-page":"856","DOI":"10.1111\/j.1540-5915.1976.tb00724.x","article-title":"On perdicting computational time of a branch-and-bound algorithm for the assignment of facilities","volume":"7","author":"Mojena","year":"1976","journal-title":"Dec. Sci."},{"issue":"1","key":"10.1016\/S0166-218X(01)00333-X_BIB16","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1137\/S1052623494273393","article-title":"implementation of a variance reduction-based lower bound in a branch-and-bound algorithm for the quadratic assignment problem","volume":"7","author":"Pardalos","year":"1997","journal-title":"SIAM J. Optim."},{"key":"10.1016\/S0166-218X(01)00333-X_BIB17","doi-asserted-by":"crossref","unstructured":"P. Pardalos, H. Wolkowicz, The quadratic assignment problem: a survey of recent developments, in: P. Pardalos, H. Wolkowicz (Eds.), Quadratic Assignment and Related Problems, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 16, AMS, Providence, 1994.","DOI":"10.1090\/dimacs\/016\/01"},{"key":"10.1016\/S0166-218X(01)00333-X_BIB18","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1287\/mnsc.12.10.B450","article-title":"The facility layout problem in perspective","volume":"12","author":"Vollmann","year":"1966","journal-title":"Manage. Sci."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X0100333X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X0100333X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T00:27:27Z","timestamp":1556584047000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X0100333X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,12]]},"references-count":18,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2002,12]]}},"alternative-id":["S0166218X0100333X"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(01)00333-x","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2002,12]]}}}