{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:18:56Z","timestamp":1760707136891},"reference-count":13,"publisher":"Elsevier BV","issue":"8","license":[{"start":{"date-parts":[[1994,10,1]],"date-time":"1994-10-01T00:00:00Z","timestamp":780969600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[1994,10]]},"DOI":"10.1016\/0305-0548(94)90015-9","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T16:15:45Z","timestamp":1056989745000},"page":"855-865","source":"Crossref","is-referenced-by-count":49,"title":["Extensions of a tabu search adaptation to the quadratic assignment problem"],"prefix":"10.1016","volume":"21","author":[{"given":"Jadranka","family":"Skorin-Kapov","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(94)90015-9_BIB1","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","article-title":"Future paths for integer programming and links to artificial intelligence","volume":"1","author":"Glover","year":"1986","journal-title":"Computers Ops Res."},{"key":"10.1016\/0305-0548(94)90015-9_BIB2","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","article-title":"Tabu search\u2014Part I","volume":"1","author":"Glover","year":"1989","journal-title":"ORSA J. Computing"},{"key":"10.1016\/0305-0548(94)90015-9_BIB3","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","article-title":"Tabu search\u2014Part II","volume":"2","author":"Glover","year":"1990","journal-title":"ORSA J. Computing"},{"key":"10.1016\/0305-0548(94)90015-9_BIB4","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1287\/ijoc.2.1.33","article-title":"Tabu search applied to the quadratic assignment problem","volume":"2","author":"Skorin-Kapov","year":"1990","journal-title":"ORSA J. Computing"},{"key":"10.1016\/0305-0548(94)90015-9_BIB5","first-page":"61","article-title":"Quadratic assignment problems","volume":"31","author":"Finke","year":"1987","journal-title":"Ann. Discrete Math"},{"key":"10.1016\/0305-0548(94)90015-9_BIB6","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1002\/nav.3800200409","article-title":"An N-step, 2-variable search algorithm for the component placement problem","volume":"20","author":"Heider","year":"1973","journal-title":"Naval Res. logist. Q."},{"key":"10.1016\/0305-0548(94)90015-9_BIB7","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1145\/356056.356062","article-title":"Algorithm 608: approximate solution to the quadratic assignment problem","volume":"9","author":"West","year":"1983","journal-title":"ACM Trans. Mathl Software"},{"key":"10.1016\/0305-0548(94)90015-9_BIB8","first-page":"240","article-title":"Target analysis to improve a tabu search for machine scheduling","volume":"16","author":"Glover","year":"1991","journal-title":"The Arabian J. Sci. Engng"},{"key":"10.1016\/0305-0548(94)90015-9_BIB9","article-title":"Candidate list strategies and tabu search","author":"Glover","year":"1989"},{"key":"10.1016\/0305-0548(94)90015-9_BIB10","unstructured":"F. Glover, Private communication (1990b)."},{"key":"10.1016\/0305-0548(94)90015-9_BIB11","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/S0167-8191(05)80147-4","article-title":"Robust taboo search for the quadratic assignment problem","volume":"17","author":"Taillard","year":"1991","journal-title":"Parallel Computing"},{"key":"10.1016\/0305-0548(94)90015-9_BIB12","article-title":"Hashing vectors for tabu search","author":"Woodruff","year":"1990"},{"key":"10.1016\/0305-0548(94)90015-9_BIB13","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1287\/opre.16.1.150","article-title":"An experimental comparison of techniques for the assignment of facilities to locations","volume":"16","author":"Nugent","year":"1968","journal-title":"Ops Res."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054894900159?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054894900159?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T17:27:48Z","timestamp":1552930068000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054894900159"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,10]]},"references-count":13,"journal-issue":{"issue":"8","published-print":{"date-parts":[[1994,10]]}},"alternative-id":["0305054894900159"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(94)90015-9","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1994,10]]}}}