{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T12:45:24Z","timestamp":1783082724775,"version":"3.54.6"},"reference-count":15,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1996,4,1]],"date-time":"1996-04-01T00:00:00Z","timestamp":828316800000},"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":6316,"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":[[1996,4]]},"DOI":"10.1016\/0166-218x(94)00137-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:35:45Z","timestamp":1027618545000},"page":"57-74","source":"Crossref","is-referenced-by-count":13,"title":["Performances of parallel branch and bound algorithms with best-first search"],"prefix":"10.1016","volume":"66","author":[{"given":"Bernard","family":"Mans","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Catherine","family":"Roucairol","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(94)00137-3_BIB1","article-title":"Parallelism in branch-and-bound algorithms","author":"Burton","year":"1983"},{"key":"10.1016\/0166-218X(94)00137-3_BIB2","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","volume":"2","author":"Fox","year":"1978","journal-title":"European J. Oper. Res."},{"issue":"6","key":"10.1016\/0166-218X(94)00137-3_BIB3","doi-asserted-by":"crossref","first-page":"1042","DOI":"10.1287\/opre.42.6.1042","article-title":"Parallel branch-and-bound algorithms: survey and synthesis","volume":"42","author":"Gendron","year":"1994","journal-title":"Oper. Res."},{"issue":"4","key":"10.1016\/0166-218X(94)00137-3_BIB4","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/BF00998631","article-title":"Theoretical comparisons of search strategies in branch-and-bound algorithms","volume":"5","author":"Ibaraki","year":"1976","journal-title":"Internat. J. Comput. Inform. Sci."},{"key":"10.1016\/0166-218X(94)00137-3_BIB5","article-title":"Enumerative Approaches to Combinatorial Optimization","author":"Ibaraki","year":"1987"},{"key":"10.1016\/0166-218X(94)00137-3_BIB6","series-title":"Proc. International Conference on Parallel Processing","first-page":"183","article-title":"Anomalies in parallel branch-and-bound algorithms","author":"Lai","year":"1983"},{"key":"10.1016\/0166-218X(94)00137-3_BIB7","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1145\/358080.358103","article-title":"Anomalies in parallel branch-and-bound algorithms","volume":"27","author":"Lai","year":"1984","journal-title":"Commun. ACM"},{"key":"10.1016\/0166-218X(94)00137-3_BIB8","doi-asserted-by":"crossref","first-page":"962","DOI":"10.1109\/TC.1985.6312201","article-title":"Performance of parallel branch-and-bound alogrithms","volume":"C34","author":"Lai","year":"1985","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0166-218X(94)00137-3_BIB9","series-title":"Comparison of concurrent priority queues for branch and bound algorithms, RR MASI-92-65, MASI","author":"Le Cun","year":"1992"},{"key":"10.1016\/0166-218X(94)00137-3_BIB10","series-title":"Proceedings 1984 International Conf. on Parallel Processing","first-page":"473","article-title":"Computational efficiency of parallel approximate branch-and-bound algorithms","author":"Li","year":"1984"},{"issue":"6","key":"10.1016\/0166-218X(94)00137-3_BIB11","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1109\/TC.1986.5009434","article-title":"Coping with anomalies in parallel branch-and-bound","volume":"C-35","author":"Li","year":"1986","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"10.1016\/0166-218X(94)00137-3_BIB12","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1109\/32.44360","article-title":"Computational efficiency of parallel combinatorial or-tree searches","volume":"16","author":"Li","year":"1990","journal-title":"IEEE Trans. Software Eng."},{"key":"10.1016\/0166-218X(94)00137-3_BIB13","unstructured":"C.H. Papadimitriou and K. Steiglitz, Combinatorial Optimization Algorithms and Complexity (Prentice-Hall, Englewood Cliffs, NJ, 182)."},{"key":"10.1016\/0166-218X(94)00137-3_BIB14","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/BF01939360","article-title":"An upper bound for the speedup of parallel branch and bound algorithms","volume":"26","author":"Quinn","year":"1986","journal-title":"BIT"},{"key":"10.1016\/0166-218X(94)00137-3_BIB15","first-page":"227","article-title":"Consistent linear speedups to a first solution in parallel state-space search","volume":"Vols. 1\u20132","author":"Saletore","year":"1990"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X94001373?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X94001373?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:27:13Z","timestamp":1556130433000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X94001373"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,4]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,4]]}},"alternative-id":["0166218X94001373"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(94)00137-3","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1996,4]]}}}