{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:39:53Z","timestamp":1752460793432},"reference-count":19,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1987,11,1]],"date-time":"1987-11-01T00:00:00Z","timestamp":562723200000},"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":9390,"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":[[1987,11]]},"DOI":"10.1016\/0166-218x(87)90022-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:01Z","timestamp":1027640581000},"page":"211-225","source":"Crossref","is-referenced-by-count":50,"title":["A parallel branch and bound algorithm for the quadratic assignment problem"],"prefix":"10.1016","volume":"18","author":[{"given":"Catherine","family":"Roucairol","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(87)90022-9_BIB1","article-title":"An algebraic and combinatorial study of the quadratic assignment problem","author":"Abreu","year":"1985","journal-title":"Euro VII"},{"key":"10.1016\/0166-218X(87)90022-9_BIB2","first-page":"53","article-title":"Some recent advances in quadratic assignment problems","author":"Burkard","year":"1984","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(87)90022-9_BIB3","series-title":"Mathematical Algorithms group-2, Internal report CSA\/3","article-title":"Parallelism in branch and bound algorithms","author":"Burton","year":"1983"},{"key":"10.1016\/0166-218X(87)90022-9_BIB4","doi-asserted-by":"crossref","first-page":"818","DOI":"10.1109\/TC.1980.1675681","article-title":"Distributed enumeration on network computers","volume":"29","author":"Dessouki","year":"1980","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0166-218X(87)90022-9_BIB5","series-title":"Quadratic assignment problems","author":"Finke","year":"1985"},{"key":"10.1016\/0166-218X(87)90022-9_BIB6","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0377-2217(78)90092-9","article-title":"Branching from the largest upper bound folklore and fact","author":"Fox","year":"1978","journal-title":"Europ. J. Oper. Res."},{"key":"10.1016\/0166-218X(87)90022-9_BIB7","first-page":"305","article-title":"Optimal and suboptimal algorithms for the quadratic assignment problem","volume":"10","author":"Gilmore","year":"1962","journal-title":"J. SIAM"},{"key":"10.1016\/0166-218X(87)90022-9_BIB8_1","article-title":"Parallel enumerative methods","author":"Kindervater","year":"1985","journal-title":"EURO VII"},{"key":"10.1016\/0166-218X(87)90022-9_BIB8_2","series-title":"Reports OS-R8512","article-title":"Experiments with parallel algorithms for combinatorial problems","author":"Kindervater","year":"1985"},{"key":"10.1016\/0166-218X(87)90022-9_BIB9","article-title":"A parallel branch and bound algorithm for asynchronous MIMD machines and computer networks","author":"Lavall\u00e9e","year":"1983","journal-title":"Rapport interne CNRS GR22"},{"key":"10.1016\/0166-218X(87)90022-9_BIB10","article-title":"Parallel branch and bound algorithms","volume":"6","author":"Lavall\u00e9e","year":"1985"},{"key":"10.1016\/0166-218X(87)90022-9_BIB11","series-title":"M\u00e9moire d'ing\u00e9nieur IIE-CNAM","article-title":"Procedures arborescentes sur machines parall\u00e9les et r\u00e9seaux de processeurs","author":"Laurent","year":"1985"},{"key":"10.1016\/0166-218X(87)90022-9_BIB12","article-title":"Etudes d'heuristiques pour le probl\u00e9me d'affectation quadratique","author":"Mautor","year":"1982","journal-title":"M\u00e9moire d'ing\u00e9nieur CNAM-IIE"},{"key":"10.1016\/0166-218X(87)90022-9_BIB13","series-title":"A study in parallel computation: the traveling salesman problem","author":"Mohan","year":"1982"},{"key":"10.1016\/0166-218X(87)90022-9_BIB14","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":"1969","journal-title":"J. Oper. Res."},{"key":"10.1016\/0166-218X(87)90022-9_BIB15","first-page":"185","article-title":"A reduction method for quadratic assignment problem","volume":"32","author":"Roucairol","year":"1979","journal-title":"Operations Research Verfahren\/Methods of Operations Research"},{"key":"10.1016\/0166-218X(87)90022-9_BIB16","series-title":"Tims XXVI, Paper no. 42","article-title":"An efficient branching scheme in branch and bound procedures","author":"Roucairol","year":"1984"},{"issue":"6","key":"10.1016\/0166-218X(87)90022-9_BIB17","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1145\/358080.358103","article-title":"Anomalies in branch and bound","volume":"27","author":"Sahni","year":"1984","journal-title":"Comm. ACM"},{"key":"10.1016\/0166-218X(87)90022-9_BIB18","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1109\/TC.1984.1676453","article-title":"Manip \u2014 a multicomputer architecture for solving combinatorial problem extremum search problems","volume":"5","author":"Wah","year":"1984","journal-title":"IEEE Trans. Comput."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X87900229?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X87900229?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T01:53:19Z","timestamp":1555120399000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X87900229"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,11]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1987,11]]}},"alternative-id":["0166218X87900229"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(87)90022-9","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1987,11]]}}}