{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,2]],"date-time":"2023-04-02T12:09:38Z","timestamp":1680437378775},"reference-count":15,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1989,7,1]],"date-time":"1989-07-01T00:00:00Z","timestamp":615254400000},"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":[[1989,7]]},"DOI":"10.1016\/0167-8191(89)90069-0","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T13:52:02Z","timestamp":1062597122000},"page":"121-126","source":"Crossref","is-referenced-by-count":9,"title":["A study of parallel branch-and-bound algorithms with best-bound-first search"],"prefix":"10.1016","volume":"11","author":[{"given":"J.M","family":"Troya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M","family":"Ortega","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"6","key":"10.1016\/0167-8191(89)90069-0_BIB1","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1145\/358141.358144","article-title":"An overview of computational complexity","volume":"26","author":"Cook","year":"1983","journal-title":"Comm. ACM"},{"key":"10.1016\/0167-8191(89)90069-0_BIB2","doi-asserted-by":"crossref","first-page":"815","DOI":"10.1109\/TC.1980.1675681","article-title":"Distributed enumeration on network computers","volume":"29","author":"El-Dessouki","year":"1980","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(89)90069-0_BIB3","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0167-8191(89)90069-0_BIB4","series-title":"Proc. IX International Symposium on Mathematical Programming","article-title":"Theoretical considerations on computational performance of branch-and-bound algorithms","author":"Ibaraki","year":"1976"},{"issue":"3","key":"10.1016\/0167-8191(89)90069-0_BIB5","first-page":"62","article-title":"A parallelized branch-and-bound algorithm: Implementation and efficiency","volume":"10","author":"Imai","year":"1979","journal-title":"System Comput. Controls"},{"issue":"6","key":"10.1016\/0167-8191(89)90069-0_BIB6","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1145\/358080.358103","article-title":"Anomalies of parallel branch-and-bound algorithms","volume":"27","author":"Lai","year":"1984","journal-title":"Comm. ACM"},{"issue":"10","key":"10.1016\/0167-8191(89)90069-0_BIB7","doi-asserted-by":"crossref","first-page":"962","DOI":"10.1109\/TC.1985.6312201","article-title":"Performance of parallel branch-and-bound algorithms","volume":"34","author":"Lai","year":"1985","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(89)90069-0_BIB8","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1287\/opre.14.4.699","article-title":"Branch-and-bound methods: A survey","volume":"14","author":"Lawler","year":"1986","journal-title":"Oper. Res."},{"key":"10.1016\/0167-8191(89)90069-0_BIB9","series-title":"Proc. International Conference on Parallel Processing","first-page":"473","article-title":"Computational efficiency of parallel approximate branch-and-bound algorithms","author":"Li","year":"1984"},{"key":"10.1016\/0167-8191(89)90069-0_BIB10","series-title":"Proc. 1977 International Conference on Parallel Processing","first-page":"199","article-title":"A parallel processor approach for searching decision trees","author":"Marshall","year":"1977"},{"key":"10.1016\/0167-8191(89)90069-0_BIB11","article-title":"A study over the parallelization of branch and bound method","author":"Ortega","year":"1987"},{"issue":"1","key":"10.1016\/0167-8191(89)90069-0_BIB12","doi-asserted-by":"crossref","DOI":"10.1145\/2422.322422","article-title":"Random trees and the analysis of branch-and-bound procedures","volume":"31","author":"Smith","year":"1984","journal-title":"J. ACM"},{"issue":"5","key":"10.1016\/0167-8191(89)90069-0_BIB13","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1109\/TC.1986.1676783","article-title":"New classes for parallel complexity: A study of unification and other complete problems for P","volume":"35","author":"Vitter","year":"1986","journal-title":"IEEE Trans. Comput."},{"issue":"6","key":"10.1016\/0167-8191(89)90069-0_BIB14","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1109\/MC.1985.1662926","article-title":"Multiprocessing of combinatorial search problems","volume":"18","author":"Wah","year":"1985","journal-title":"Computer"},{"issue":"5","key":"10.1016\/0167-8191(89)90069-0_BIB15","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1109\/TC.1984.1676453","article-title":"MANIP - A multicomputer architecture for solving combinatorial extremum-search problems","volume":"33","author":"Wah","year":"1984","journal-title":"IEEE Trans. Comput."}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819189900690?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819189900690?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T04:24:55Z","timestamp":1551068695000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167819189900690"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,7]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,7]]}},"alternative-id":["0167819189900690"],"URL":"https:\/\/doi.org\/10.1016\/0167-8191(89)90069-0","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1989,7]]}}}