{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T00:54:49Z","timestamp":1772758489081,"version":"3.50.1"},"reference-count":14,"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)90018-3","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T16:15:45Z","timestamp":1056989745000},"page":"885-893","source":"Crossref","is-referenced-by-count":41,"title":["A study of diversification strategies for the quadratic assignment problem"],"prefix":"10.1016","volume":"21","author":[{"given":"James P.","family":"Kelly","sequence":"first","affiliation":[]},{"given":"Manuel","family":"Laguna","sequence":"additional","affiliation":[]},{"given":"Fred","family":"Glover","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(94)90018-3_BIB1","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/BF02023002","article-title":"Solving the maximum clique problem using a tabu search approach","volume":"41","author":"Gendreau","year":"1993","journal-title":"Ann. Ops Res."},{"key":"10.1016\/0305-0548(94)90018-3_BIB2","article-title":"A parallel taboo search algorithm for large travelling salesman problem","author":"Fiechter","year":"1990"},{"key":"10.1016\/0305-0548(94)90018-3_BIB3","article-title":"A framework for diversification in tabu search","author":"Woodruff","year":"1990"},{"key":"10.1016\/0305-0548(94)90018-3_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 Journal on Computing"},{"key":"10.1016\/0305-0548(94)90018-3_BIB5","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0957-4174(93)90056-C","article-title":"Integrating target analysis and tabu search for improved scheduling systems","volume":"6","author":"Laguna","year":"1993","journal-title":"Experts Systems Applic."},{"key":"10.1016\/0305-0548(94)90018-3_BIB6","doi-asserted-by":"crossref","unstructured":"F. Gover and M. Laguna, Bandwidth packing: a tabu search approach. Mgmt Sci.39, 492\u2013500.","DOI":"10.1287\/mnsc.39.4.492"},{"key":"10.1016\/0305-0548(94)90018-3_BIB7","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/0377-2217(84)90093-6","article-title":"Quadratic assignment problems","volume":"15","author":"Burckard","year":"1984","journal-title":"European Journal of Research"},{"key":"10.1016\/0305-0548(94)90018-3_BIB8","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\/0305-0548(94)90018-3_BIB9","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. Assoc. Comput. Mach."},{"key":"10.1016\/0305-0548(94)90018-3_BIB10","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 Comput."},{"key":"10.1016\/0305-0548(94)90018-3_BIB11","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0167-8191(89)90025-2","article-title":"Algorithms for assignment problems on an array processor","volume":"15","author":"Frieze","year":"1989","journal-title":"Parallel Computing"},{"key":"10.1016\/0305-0548(94)90018-3_BIB12","doi-asserted-by":"crossref","first-page":"855","DOI":"10.1016\/0305-0548(94)90015-9","article-title":"Extensions of a tabu search adaptation to the quadratic assignment problem","volume":"21","author":"Skorin-Kapov","year":"1994","journal-title":"Computers Ops Res."},{"key":"10.1016\/0305-0548(94)90018-3_BIB13","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1016\/0305-0548(94)90017-5","article-title":"Applying tabu search with influential diversification to multiprocessor scheduling","volume":"21","author":"H\u00fcbscher","year":"1994","journal-title":"Computers Ops Res."},{"key":"10.1016\/0305-0548(94)90018-3_BIB14","article-title":"Manifold search techniques applied to the quadratic assignment problem","author":"Gavish","year":"1991"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054894900183?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054894900183?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,24]],"date-time":"2020-03-24T10:21:49Z","timestamp":1585045309000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054894900183"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,10]]},"references-count":14,"journal-issue":{"issue":"8","published-print":{"date-parts":[[1994,10]]}},"alternative-id":["0305054894900183"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(94)90018-3","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1994,10]]}}}