{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:33:14Z","timestamp":1725456794821},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540615491"},{"type":"electronic","value":"9783540688082"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/bfb0030117","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T00:38:48Z","timestamp":1133397528000},"page":"277-284","source":"Crossref","is-referenced-by-count":3,"title":["An interface design for general parallel branch-and-bound algorithms"],"prefix":"10.1007","author":[{"given":"Yuji","family":"Shinano","sequence":"first","affiliation":[]},{"given":"Masahiro","family":"Higaki","sequence":"additional","affiliation":[]},{"given":"Ryuichi","family":"Hirabayashi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,16]]},"reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"R.Corr\u00eaa. A Parallel Formulation for General Branch-and-Bound Algorithms. Parallel Algorithms for Irregularly Structured Problems, A.Ferreira and J.Rolim(eds.), LNCS 980, 395\u2013409, Springer, 1995.","DOI":"10.1007\/3-540-60321-2_31"},{"issue":"6","key":"24_CR2","doi-asserted-by":"crossref","first-page":"1042","DOI":"10.1287\/opre.42.6.1042","volume":"42","author":"B. Gendron","year":"1994","unstructured":"B.Gendron and T.G.Crainic. Parallel Branch-and-Bound Algorithms: Survey and Synthesis. Operations Research, 42(6):1042\u20131066, 1994.","journal-title":"Operations Research"},{"issue":"2","key":"24_CR3","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1145\/322003.322010","volume":"24","author":"T. Ibaraki","year":"1977","unstructured":"T.Ibaraki. The Power of Dominance Relations in Branch-and-Bound Algorithms. Journal of the ACM, 24(2):264\u2013279, 1977.","journal-title":"Journal of the ACM"},{"key":"24_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0019-9958(78)90197-3","volume":"36","author":"T. Ibaraki","year":"1978","unstructured":"T.Ibaraki. Branch-and-Bound Procedure and State-Space Representation of Combinatorial Optimization Problems. Information and Control, 36:1\u201327, 1978.","journal-title":"Information and Control"},{"key":"24_CR5","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/S0004-3702(83)80009-5","volume":"21","author":"V. Kumar","year":"1983","unstructured":"V.Kumar and L.N.Kanal. A General Branch and Bound Formulation for Understanding and Synthesizing And\/Or Tree Search Procedures. Artificial Intelligence, 21:179\u2013198, 1983.","journal-title":"Artificial Intelligence"},{"key":"24_CR6","doi-asserted-by":"publisher","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. Annals of Operations Research, 33:379\u2013402, 1991.","journal-title":"Annals of Operations Research"},{"key":"24_CR7","unstructured":"G.P.McKeown, V.J.Rayward-Smith and S.A.Rush. Parallel Branch-and-Bound. Advances in Parallel Algorithms, L.Kronsj\u00f6 and D.Shumsheruddin(eds.), Advanced topics in computer science, 111\u2013150, Blackwell, 1992."},{"key":"24_CR8","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/0004-3702(84)90004-3","volume":"23","author":"D.S. Nau","year":"1984","unstructured":"D.S.Nau, V.Kumar and L.Kanal. General Branch and Bound, and Its Relation to A* and AO *. Artificial Intelligence, 23:29\u201358, 1984.","journal-title":"Artificial Intelligence"},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"Y.Shinano, M.Higaki and R.Hirabayashi. A Genearlized Utility for Parallel Branch and Bound Algorithms. Proc. of the 7th IEEE Symposium on Parallel and Distributed Processing, 392\u2013401, IEEE Computer Society Press, 1995.","DOI":"10.1109\/SPDP.1995.530710"},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"S.Tch\u00f6ke, R.L\u00fcling and B.Monien. Solving the Traveling Salesman Problem with a Distributed Branch-and-Bound Algorithm on a 1024 Processor Network. Proc. of the 9th International Parallel Processing Symposium, Santa Barbara, CA, April 1995. To appear.","DOI":"10.1109\/IPPS.1995.395930"}],"container-title":["Lecture Notes in Computer Science","Parallel Algorithms for Irregularly Structured Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0030117","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T10:19:28Z","timestamp":1554718768000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0030117"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540615491","9783540688082"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/bfb0030117","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}