{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:36:25Z","timestamp":1759847785041,"version":"3.41.2"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1997,9,1]],"date-time":"1997-09-01T00:00:00Z","timestamp":873072000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1997,9,1]],"date-time":"1997-09-01T00:00:00Z","timestamp":873072000000},"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":["Computational Optimization and Applications"],"published-print":{"date-parts":[[1997,9]]},"DOI":"10.1023\/a:1008696503659","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T10:12:40Z","timestamp":1040551960000},"page":"111-127","source":"Crossref","is-referenced-by-count":48,"title":["Solving Large Quadratic Assignment Problems in Parallel"],"prefix":"10.1007","volume":"8","author":[{"given":"Jens","family":"Clausen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Perregaard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"136834_CR1","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1287\/mnsc.9.2.294","volume":"9","author":"G. Armour","year":"1963","unstructured":"G. Armour and E. Buffa, \"A heuristic algorithm and simulation approach to the relative allocation of facilities,\" Mgt. Sci., vol. 9, pp. 294\u2013309, 1963.","journal-title":"Mgt. Sci."},{"key":"136834_CR2","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0167-6377(85)90025-2","volume":"4","author":"A.A. Assad","year":"1985","unstructured":"A.A. Assad and W. Xu, \"On lower bounds for a class of quadratic 0, 1 programs,\" Oper. Res. Letters, vol. 4, pp. 175\u2013180, 1985.","journal-title":"Oper. Res. Letters"},{"key":"136834_CR3","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1002\/nav.3800300210","volume":"30","author":"M.S. Bazaraa","year":"1983","unstructured":"M.S. Bazaraa and O. Kirca, \"A branch-and-bound-based heuristic for solving the quadratic assignment problem,\" Naval Research Logistics Quarterly, vol. 30, pp. 287\u2013304, 1983.","journal-title":"Naval Research Logistics Quarterly"},{"key":"136834_CR4","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1016\/0377-2217(83)90097-8","volume":"13","author":"R. Burkard","year":"1983","unstructured":"R. Burkard and U. Derigs, \"Assignment and matching problems,\" EJOR, vol. 13, pp. 374\u2013386, 1983.","journal-title":"EJOR"},{"key":"136834_CR5","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1287\/opre.40.1.S22","volume":"40","author":"P. Carraresi","year":"1992","unstructured":"P. Carraresi and F. Malucelli, \"A new lower bound for the quadratic assignment problem,\" Oper. Res., vol. 40, no. S.1, pp. 22\u201327, 1992.","journal-title":"Oper. Res."},{"key":"136834_CR6","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1090\/dimacs\/016\/06","volume":"16","author":"P. Carraresi","year":"1994","unstructured":"P. Carraresi and F. Malucelli, \"A reformulation scheme and new lower bounds for the QAP,\" Dimacs Series in Discrete Mathematics and Theoretical Computer Science, vol. 16, pp. 147\u2013160, 1994.","journal-title":"Dimacs Series in Discrete Mathematics and Theoretical Computer Science"},{"key":"136834_CR7","first-page":"331","volume":"3","author":"J. Clausen","year":"1991","unstructured":"J. Clausen and J.L. Tr\u00e4ff, \"Implementation of parallel branch-and-bound algorithms-experiences with the graph partitioning problem,\" Annals of Oper. Res., vol. 33, pp. 331\u2013349, 1991.","journal-title":"Annals of Oper. Res."},{"key":"136834_CR8","unstructured":"J. Clausen and M. Perregaard, \"Implementation of a parallel branch and bound algorithm for quadratic assignment problems on a 16 processor MEIKO i860 hypercube,\" Tech. Report, DIKU, 1994."},{"key":"136834_CR9","doi-asserted-by":"crossref","unstructured":"J. Crouse and P. Pardalos, \"A parallel algorithm for the quadratic assignment problem,\" Proceedings of Supercomputing '89, ACM Press, pp. 351\u2013360, 1989.","DOI":"10.1145\/76263.76302"},{"key":"136834_CR10","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1057\/jors.1977.29","volume":"28","author":"A. Elshafei","year":"1977","unstructured":"A. Elshafei, \"Hospital lay-out as a quadratic assignment problem,\" Oper. Res. Quaterly, vol. 28, pp. 167\u2013179, 1977.","journal-title":"Oper. Res. Quaterly"},{"key":"136834_CR11","doi-asserted-by":"crossref","unstructured":"S.W. Hadley, F. Rendl, and H. Wolkowicz, \"A new lower bound via projection for the quadratic assignment problem,\" Math. of Oper. Res., vol. 17, pp. 727\u2013739.","DOI":"10.1287\/moor.17.3.727"},{"key":"136834_CR12","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0167-6377(86)90073-8","volume":"5","author":"R. Jonker","year":"1986","unstructured":"R. Jonker and A. Volgenant, \"Improving the Hungarian assignment algorithm,\" Operations Research Letters, vol. 5, pp. 171\u2013175, 1986.","journal-title":"Operations Research Letters"},{"key":"136834_CR13","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0167-8191(93)90044-L","volume":"19","author":"P.S. Laursen","year":"1993","unstructured":"P.S. Laursen, \"Simple approaches to parallel branch and bound,\" Parallel Computing, vol. 19, pp. 143\u2013152, 1993.","journal-title":"Parallel Computing"},{"key":"136834_CR14","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0166-218X(94)90014-0","volume":"55","author":"T. Mautor","year":"1994","unstructured":"T. Mautor and C. Roucaurol, \"A new exact algorithm for the solution of quadratic assignment problems,\" Discrete Applied Mathematics, vol. 55, pp. 281\u2013293, 1994.","journal-title":"Discrete Applied Mathematics"},{"key":"136834_CR15","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1287\/opre.16.1.150","volume":"16","author":"C. Nugent","year":"1968","unstructured":"C. Nugent, T. Vollmann, and J. Ruml, \"An experimental comparison of techniques for the assignment of facilities to locations,\" Oper. Res., vol. 16, pp. 150\u2013173, 1968.","journal-title":"Oper. Res."},{"key":"136834_CR16","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/0377-2217(85)90009-8","volume":"20","author":"F. Rendl","year":"1985","unstructured":"F. Rendl, \"Ranking scalar products to improve bounds for the quadratic assignment problem,\" EJOR, vol. 20, pp. 363\u2013372, 1985.","journal-title":"EJOR"},{"key":"136834_CR17","doi-asserted-by":"crossref","unstructured":"F. Rendl and H. Wolkowicz, \"Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem,\" Math. Prog., pp. 63\u201378, 1992.","DOI":"10.1007\/BF01585694"},{"key":"136834_CR18","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0166-218X(87)90022-9","volume":"18","author":"C. Roucaurol","year":"1987","unstructured":"C. Roucaurol, \"A parallel branch and bound algorithm for the quadratic assignment problem,\" Discr. Appl. Math., vol. 18, pp. 211\u2013225, 1987.","journal-title":"Discr. Appl. Math."},{"key":"136834_CR19","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1287\/mnsc.22.2.172","volume":"22","author":"M. Scriabin","year":"1975","unstructured":"M. Scriabin and R. Vergin, \"Comparison of computer algorithms and visual based methods for plant layout,\" Mgt. Sci., vol. 22, pp. 172\u2013181, 1975.","journal-title":"Mgt. Sci."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008696503659.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008696503659\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008696503659.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:14:35Z","timestamp":1752376475000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008696503659"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,9]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,9]]}},"alternative-id":["136834"],"URL":"https:\/\/doi.org\/10.1023\/a:1008696503659","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[1997,9]]}}}