{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:04Z","timestamp":1761611164028},"reference-count":20,"publisher":"Springer Science and Business Media LLC","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":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[1993,2]]},"DOI":"10.1007\/bf02024489","type":"journal-article","created":{"date-parts":[[2005,8,5]],"date-time":"2005-08-05T19:52:41Z","timestamp":1123271561000},"page":"123-145","source":"Crossref","is-referenced-by-count":15,"title":["Efficiency considerations in the implementation of parallel branch-and-bound"],"prefix":"10.1007","volume":"43","author":[{"given":"V. J.","family":"Rayward-Smith","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. A.","family":"Rush","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G. P.","family":"McKeown","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02024489_CR1","unstructured":"F.W. Burton, G.P. McKeown, V.J. Rayward-Smith and M.R. Sleep, Parallel processing and combinatorial optimization, in:Proc. Combinatorial Optimization III Conf., ed. L.B. Wilson, C.S. Edwards and V.J. Rayward-Smith, Stirling (1982) pp. 19\u201336."},{"key":"BF02024489_CR2","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/BF02073939","volume":"33","author":"J. Clausen","year":"1991","unstructured":"J. Clausen and J.L. Tr\u00e4ff, Implementation of parallel branch-and-bound algorithms \u2014 experiences with the graph partitioning problem, Ann. Oper. Res. 33(1991)331\u2013349.","journal-title":"Ann. Oper. Res."},{"key":"BF02024489_CR3","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0167-8191(86)90024-4","volume":"3","author":"V. Faber","year":"1986","unstructured":"V. Faber, O.M. Lubeck and B. White Jr., Superlinear speedup of an efficient sequential algorithm is not possible, Parallel Comput. 3(1986)259\u2013260.","journal-title":"Parallel Comput."},{"key":"BF02024489_CR4","first-page":"62","volume":"10","author":"M. Imai","year":"1979","unstructured":"M. Imai, T. Fukumura and Y. Yoshida, A parallelized branch-and-bound algorithm: Implementation and efficiency. Syst. Comp. Controls 10(1979)62\u201370.","journal-title":"Syst. Comp. Controls"},{"key":"BF02024489_CR5","volume-title":"Transputer Reference Manual","author":"INMOS Ltd.","year":"1988","unstructured":"INMOS Ltd.,Transputer Reference Manual (Prentice-Hall, London, 1988)"},{"key":"BF02024489_CR6","unstructured":"INMOS Ltd.,The Transputer Databook, INMOS Databook Series, 2nd ed. (INMOS Ltd., 1989)."},{"key":"BF02024489_CR7","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1145\/358080.358103","volume":"27","author":"T. Lai","year":"1984","unstructured":"T. Lai and S. Sahni, Anomalies in parallel branch-and-bound algorithms, Commun. ACM 27(1984)594\u2013602.","journal-title":"Commun. ACM"},{"key":"BF02024489_CR8","doi-asserted-by":"crossref","first-page":"972","DOI":"10.1287\/opre.11.6.972","volume":"11","author":"J.D.C. Little","year":"1963","unstructured":"J.D.C. Little, K.G. Murty, D.W. Sweeney and C. Karel, An algorithm for the travelling salesman problem, Oper. Res. 11(1963)972\u2013989.","journal-title":"Oper. Res."},{"key":"BF02024489_CR9","first-page":"781","volume-title":"Proc. TRANSPUTING '91 Conf., Vol. 2","author":"G.P. McKeown","year":"1991","unstructured":"G.P. McKeown, V.J. Rayward-Smith, S.A. Rush and H.J. Turpin, Using a transputer network to solve branch-and-bound problems, in:Proc. TRANSPUTING '91 Conf., Vol. 2, ed. P. Welch, D. Stiles, T. Kunii and A. Bakkers (IOS Press, Amsterdam, 1991) pp. 781\u2013800."},{"key":"BF02024489_CR10","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/BF02073942","volume":"33","author":"G.P. McKeown","year":"1991","unstructured":"G.P. McKeown, V.J. Rayward-Smith and H.J. Turpin, Branch-and-bound as a higher order function, Ann. Oper. Res. 33(1991)379\u2013402.","journal-title":"Ann. Oper. Res."},{"key":"BF02024489_CR11","unstructured":"J. Mohan, Experience with two parallel programs solving the travelling sales man problem, in:Proc. 1983 Int. Conf. on Parallel Processing (1983) pp. 191\u2013193."},{"key":"BF02024489_CR12","series-title":"Research Report","volume-title":"Using a transputer ring to transform raster images","author":"S.A. Rush","year":"1989","unstructured":"S.A. Rush, Using a transputer ring to transform raster images, Research Report R171, University of Exeter, Exeter, England (1989)."},{"key":"BF02024489_CR13","volume-title":"Parallel branch-and-bound on a network of transputers","author":"S.A. Rush","year":"1992","unstructured":"S.A. Rush, Parallel branch-and-bound on a network of transputers, PhD Thesis, School of Information Systems, University of East Anglia, Norwich, NR4 7TJ, England (1992)."},{"key":"BF02024489_CR14","unstructured":"H.M. Salkin,Integer Programming (Addison-Wesley, 1975)."},{"key":"BF02024489_CR15","unstructured":"A. Schrijver,Theory of Linear and Integer Programming, Wiley-Interscience Series in Discrete Mathematics and Optimization (Wiley, 1986)."},{"key":"BF02024489_CR16","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1002\/net.3230120309","volume":"12","author":"M.L. Shore","year":"1982","unstructured":"M.L. Shore, L.R. Foulds and P.B. Gibbons, An algorithm for the Steiner problem in graphs, Networks 12(1982)323\u2013333.","journal-title":"Networks"},{"key":"BF02024489_CR17","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0020-0190(84)90071-1","volume":"18","author":"R.W. Topor","year":"1984","unstructured":"R.W. Topor, Termination detection for distributed computations, Infor. Proc. Lett. 18(1984)33\u201336.","journal-title":"Infor. Proc. Lett."},{"key":"BF02024489_CR18","volume-title":"The branch-and-bound paradigm","author":"H.J. Turpin","year":"1991","unstructured":"H.J. Turpin, The branch-and-bound paradigm, Ph.D. Thesis, School of Information Systems, Norwich (1991)."},{"key":"BF02024489_CR19","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1109\/TC.1984.1676453","volume":"C-33","author":"B.W. Wah","year":"1984","unstructured":"B.W. Wah and Y.W.E. Ma, MANIP \u2014 a multicomputer architecture for solving combinatorial extreme-search problems, IEEE Trans Comput. C-33(1984)377\u2013390.","journal-title":"IEEE Trans Comput."},{"key":"BF02024489_CR20","doi-asserted-by":"crossref","first-page":"1126","DOI":"10.1109\/TC.1982.1675930","volume":"C-31","author":"B.W. Weide","year":"1982","unstructured":"B.W. Weide, Modelling unusual behaviour of parallel algorithms, IEEE Trans. Comput. C-31(1982)1126\u20131130.","journal-title":"IEEE Trans. Comput."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02024489.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02024489\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02024489","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T22:42:40Z","timestamp":1557787360000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02024489"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,2]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,2]]}},"alternative-id":["BF02024489"],"URL":"https:\/\/doi.org\/10.1007\/bf02024489","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,2]]}}}