{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T05:05:16Z","timestamp":1773983116127,"version":"3.50.1"},"reference-count":16,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1993,2,1]],"date-time":"1993-02-01T00:00:00Z","timestamp":728524800000},"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":["Parallel Computing"],"published-print":{"date-parts":[[1993,2]]},"DOI":"10.1016\/0167-8191(93)90044-l","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T17:52:02Z","timestamp":1062611522000},"page":"143-152","source":"Crossref","is-referenced-by-count":23,"title":["Simple approaches to parallel Branch and Bound"],"prefix":"10.1016","volume":"19","author":[{"given":"Per S","family":"Laursen","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-8191(93)90044-L_BIB1","first-page":"61","article-title":"Quadratic assignment problems","volume":"31","author":"Burkard","year":"1987","journal-title":"Annals Discrete Math."},{"key":"10.1016\/0167-8191(93)90044-L_BIB2","article-title":"A new Branch and Bound algorithm for the Quadratic Assignment Problem","author":"Carraresi","year":"1990"},{"key":"10.1016\/0167-8191(93)90044-L_BIB3","article-title":"Implementation of Parallel Branch and Bound algorithms \u2014 Experiences with the graph partitioning problem","author":"Clausen","year":"1989"},{"key":"10.1016\/0167-8191(93)90044-L_BIB4","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0020-0190(83)90092-3","article-title":"Derivation of a termination detection algorithm for distributed computation","volume":"16","author":"Dijkstra","year":"1983","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0167-8191(93)90044-L_BIB5","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1137\/0110022","article-title":"Optimal and suboptimal algorithms for the Quadratic Assignment Problem","volume":"10","author":"Gilmore","year":"1962","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0167-8191(93)90044-L_BIB6","series-title":"Optimal Strategies in Sports","first-page":"169","article-title":"Assigning runners to a relay team","author":"Heffley","year":"1977"},{"key":"10.1016\/0167-8191(93)90044-L_BIB7","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1007\/3-540-51687-5_38","article-title":"Building a global time on parallel machines","volume":"392","author":"Jezequel","year":"1989","journal-title":"Lecture Notes in Comput. Sci."},{"key":"10.1016\/0167-8191(93)90044-L_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\/0167-8191(93)90044-L_BIB9","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BFb0120827","article-title":"Computer-aided layout design","volume":"9","author":"Krarup","year":"1978","journal-title":"math. Programming Study"},{"key":"10.1016\/0167-8191(93)90044-L_BIB10","article-title":"New parallel Branch and Bound algorithms for the Quadratic Assignment Problem","author":"Laursen","year":"1991"},{"key":"10.1016\/0167-8191(93)90044-L_BIB11","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1287\/mnsc.9.4.586","article-title":"The Quadratic Assignment Problem","volume":"9","author":"Lawler","year":"1963","journal-title":"Management Sci."},{"key":"10.1016\/0167-8191(93)90044-L_BIB12","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1007\/3-540-51687-5_40","article-title":"Two strategies for solving the vertex cover problem on a transputer network","volume":"392","author":"L\u00fcling","year":"1989","journal-title":"Lecture Notes in Comput. Sci."},{"key":"10.1016\/0167-8191(93)90044-L_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":"Operat. Res."},{"key":"10.1016\/0167-8191(93)90044-L_BIB14","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/0165-6074(89)90212-3","article-title":"Live nodes distribution in Parallel Branch and Bound Algorithms","volume":"25","author":"Ortega","year":"1989","journal-title":"Microprocessing & Microprogramming"},{"key":"10.1016\/0167-8191(93)90044-L_BIB15","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0166-218X(87)90022-9","article-title":"A parallel Branch and Bound algorithm for the Quadratic Assignment Problem","volume":"18","author":"Roucairol","year":"1987","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0167-8191(93)90044-L_BIB16","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/S0167-8191(05)80147-4","article-title":"Robust tabu search for the Quadratic Assignment Problem","volume":"17","author":"Taillard","year":"1991","journal-title":"Parallel Comput."}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016781919390044L?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016781919390044L?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T09:27:41Z","timestamp":1551086861000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016781919390044L"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,2]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,2]]}},"alternative-id":["016781919390044L"],"URL":"https:\/\/doi.org\/10.1016\/0167-8191(93)90044-l","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1993,2]]}}}