{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T06:29:47Z","timestamp":1773815387933,"version":"3.50.1"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,3,10]],"date-time":"2017-03-10T00:00:00Z","timestamp":1489104000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"spanish Ministry","award":["TIN2014-53522- REDT"],"award-info":[{"award-number":["TIN2014-53522- REDT"]}]},{"name":"spanish Ministry","award":["TIN2015-66680"],"award-info":[{"award-number":["TIN2015-66680"]}]},{"name":"Spanish FPU program"},{"DOI":"10.13039\/501100011011","name":"Junta Andaluc\u00eda","doi-asserted-by":"crossref","award":["P11- TIC-7176"],"award-info":[{"award-number":["P11- TIC-7176"]}],"id":[{"id":"10.13039\/501100011011","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100011011","name":"Junta Andaluc\u00eda","doi-asserted-by":"crossref","award":["P12-TIC-301"],"award-info":[{"award-number":["P12-TIC-301"]}],"id":[{"id":"10.13039\/501100011011","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2017,11]]},"DOI":"10.1007\/s10898-017-0508-y","type":"journal-article","created":{"date-parts":[[2017,3,10]],"date-time":"2017-03-10T11:23:50Z","timestamp":1489145030000},"page":"547-560","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["On parallel Branch and Bound frameworks for Global Optimization"],"prefix":"10.1007","volume":"69","author":[{"given":"Juan F. R.","family":"Herrera","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5074-1662","authenticated-orcid":false,"given":"Jos\u00e9 M. G.","family":"Salmer\u00f3n","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1572-1436","authenticated-orcid":false,"given":"Eligius M. T.","family":"Hendrix","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1570-3863","authenticated-orcid":false,"given":"Rafael","family":"Asenjo","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8459-4982","authenticated-orcid":false,"given":"Leocadio G.","family":"Casado","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,3,10]]},"reference":[{"key":"508_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"927","DOI":"10.1007\/3-540-45706-2_132","volume-title":"Euro-Par 2002 Parallel Processing","author":"E Alba","year":"2002","unstructured":"Alba, E., Almeida, F., Blesa, M., Cabeza, J., Cotta, C., Daz, M., Dorta, I., Gabarr, J., Len, C., Luna, J., Moreno, L., Pablos, C., Petit, J., Rojas, A., Xhafa, F.: Mallba: a library of skeletons for combinatorial optimisation. In: Monien, B., Feldmann, R. (eds.) Euro-Par 2002 Parallel Processing. Lecture Notes in Computer Science, vol. 2400, pp. 927\u2013932. Springer, Berlin (2002)"},{"key":"508_CR2","doi-asserted-by":"publisher","unstructured":"Amar, P., Baillieul, M., Barth, D., LeCun, B., Quessette, F., Vial, S.: Parallel biological in silico simulation. In: Czach\u00f3rski, T., Gelenbe, E., Lent, R. (eds.) Information Sciences and Systems 2014: Proceedings of the 29th International Symposium on Computer and Information Sciences, pp. 387\u2013394. Springer, Cham (2014). doi:\n                        10.1007\/978-3-319-09465-6_40","DOI":"10.1007\/978-3-319-09465-6_40"},{"issue":"2","key":"508_CR3","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF01096738","volume":"3","author":"W Baritompa","year":"1993","unstructured":"Baritompa, W.: Customizing methods for global optimization, a geometric viewpoint. J. Glob. Optim. 3(2), 193\u2013212 (1993)","journal-title":"J. Glob. Optim."},{"key":"508_CR4","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1023\/A:1018972901171","volume":"90","author":"A Br\u00fcngger","year":"1999","unstructured":"Br\u00fcngger, A., Marzetta, A., Fukuda, K., Nievergelt, J.: The parallel search bench ZRAM and its applications. Ann. Op. Res. 90, 45\u201363 (1999)","journal-title":"Ann. Op. Res."},{"issue":"4","key":"508_CR5","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1007\/s10898-007-9157-x","volume":"39","author":"LG Casado","year":"2007","unstructured":"Casado, L.G., Hendrix, E.M.T., Garc\u00eda, I.: Infeasibility spheres for finding robust solutions of blending problems with quadratic constraints. J. Glob. Optim. 39(4), 577\u2013593 (2007)","journal-title":"J. Glob. Optim."},{"issue":"5","key":"508_CR6","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1080\/10556780802086300","volume":"23","author":"LG Casado","year":"2008","unstructured":"Casado, L.G., Mart\u00ednez, J.A., Garc\u00eda, I., Hendrix, E.M.T.: Branch-and-Bound interval global optimization on shared memory multiprocessors. Optim. Method Softw. 23(5), 689\u2013701 (2008)","journal-title":"Optim. Method Softw."},{"key":"508_CR7","doi-asserted-by":"publisher","unstructured":"Crainic, T.G., Le Cun, B., Roucairol, C.: Parallel branch-and-bound algorithms. In: Parallel Combinatorial Optimization, pp. 1\u201328. Wiley (2006). doi:\n                        10.1002\/9780470053928.ch1","DOI":"10.1002\/9780470053928.ch1"},{"key":"508_CR8","doi-asserted-by":"publisher","unstructured":"Djerrah, A., Le\u00a0Cun, B., Cung, V.D., Roucairol, C.: Bob++: framework for solving optimization problems with branch-and-bound methods. In: 2006 15th IEEE International Conference on High Performance Distributed Computing, pp. 369\u2013370 (2006). doi:\n                        10.1109\/HPDC.2006.1652188","DOI":"10.1109\/HPDC.2006.1652188"},{"key":"508_CR9","first-page":"219","volume-title":"Pico: An Object-Oriented Framework for Parallel Branch and Bound","author":"J Eckstein","year":"2001","unstructured":"Eckstein, J., Phillips, C.A., Hart, W.E.: Inherently parallel algorithms in feasibility and optimization and their applications, studies in computational mathematics. In: Dan\u00a0Butnariu, Y.C. (ed.) Pico: An Object-Oriented Framework for Parallel Branch and Bound, vol. 8, pp. 219\u2013265. Elsevier, Amsterdam (2001)"},{"issue":"4","key":"508_CR10","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1007\/s12532-015-0087-1","volume":"7","author":"J Eckstein","year":"2015","unstructured":"Eckstein, J., Hart, W.E., Phillips, C.A.: PEBBL: an object-oriented framework for scalable parallel Branch and Bound. Math. Program. Comput. 7(4), 429\u2013469 (2015)","journal-title":"Math. Program. Comput."},{"key":"508_CR11","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1109\/TPDS.2015.2407896","volume":"27","author":"FA Escobar","year":"2016","unstructured":"Escobar, F.A., Chang, X., Valderrama, C.: Suitability analysis of FPGAs for heterogeneous platforms in HPC. IEEE Trans. Parallel. Distrib. 27, 600\u2013612 (2016). doi:\n                        10.1109\/TPDS.2015.2407896","journal-title":"IEEE Trans. Parallel. Distrib."},{"key":"508_CR12","unstructured":"Galea, F., Le\u00a0Cun, B.: Bob++ : a framework for exact combinatorial optimization methods on parallel machines. In: PGCO\u20192007 as Part of HPCS\u201907, pp. 779\u2013785 (2007)"},{"issue":"6","key":"508_CR13","doi-asserted-by":"crossref","first-page":"1042","DOI":"10.1287\/opre.42.6.1042","volume":"42","author":"B Gendron","year":"1994","unstructured":"Gendron, B., Crainic, T.G.: Parallel Branch-and-Bound algorithms: survey and synthesis. Oper. Res. 42(6), 1042\u20131066 (1994)","journal-title":"Oper. Res."},{"key":"508_CR14","doi-asserted-by":"publisher","unstructured":"Gonz\u00e1lez, C.H., Fraguela, B.B.: A generic algorithm template for divide-and-conquer in multicore systems. In: 2010 IEEE 12th International Conference on High Performance Computing and Communications (HPCC), pp. 79\u201388 (2010). doi:\n                        10.1109\/HPCC.2010.24","DOI":"10.1109\/HPCC.2010.24"},{"key":"508_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-88670-1","volume-title":"Introduction to Nonlinear and Global Optimization","author":"EMT Hendrix","year":"2010","unstructured":"Hendrix, E.M.T., T\u00f3th, B.G.: Introduction to Nonlinear and Global Optimization. Springer, New York (2010)"},{"key":"508_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/978-3-642-31137-6_12","volume-title":"Computational Science and its Applications ICCSA 2012","author":"EMT Hendrix","year":"2012","unstructured":"Hendrix, E.M.T., Casado, L.G., Amaral, P.: Global Optimization simplex bisection revisited based on considerations by Reiner Horst. In: Murgante, B., et al. (eds.) Computational Science and its Applications ICCSA 2012. Lecture Notes in Computer Science, vol. 7335, pp. 159\u2013173. Springer, Heidelberg (2012)"},{"key":"508_CR17","doi-asserted-by":"publisher","unstructured":"Herrera, J.F.R., Casado, L.G., Hendrix, E.M.T., Paulavi\u010dius, R., \u017dilinskas, J.: Dynamic and hierarchical Load-Balancing techniques applied to parallel branch-and-bound methods. In: 2013 Eighth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing, pp. 497\u2013502 (2013). doi:\n                        10.1109\/3PGCIC.2013.85","DOI":"10.1109\/3PGCIC.2013.85"},{"key":"508_CR18","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/978-3-319-21407-8_32","volume-title":"Computational Science and Its Applications\u2014ICCSA 2015","author":"JFR Herrera","year":"2015","unstructured":"Herrera, J.F.R., Casado, L.G., Hendrix, E.M.T., Garc\u00eda, I.: Heuristics for longest edge selection in simplicial Branch and Bound. In: Gervasi, O., et al. (eds.) Computational Science and Its Applications\u2014ICCSA 2015, pp. 445\u2013456. Springer, Berlin (2015)"},{"issue":"6","key":"508_CR19","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1145\/358080.358103","volume":"27","author":"TH Lai","year":"1984","unstructured":"Lai, T.H., Sahni, S.: Anomalies in parallel Branch-and-Bound algorithms. Commun. ACM 27(6), 594\u2013602 (1984)","journal-title":"Commun. ACM"},{"issue":"4","key":"508_CR20","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1287\/opre.14.4.699","volume":"14","author":"EL Lawler","year":"1966","unstructured":"Lawler, E.L., Wood, D.E.: Branch-and-Bound methods: a survey. Oper. Res. 14(4), 699\u2013719 (1966)","journal-title":"Oper. Res."},{"issue":"6","key":"508_CR21","first-page":"568","volume":"35","author":"GJ Li","year":"1986","unstructured":"Li, G.J., Wah, B.W.: Coping with anomalies in parallel Branch-and-Bound algorithms. IEEE Trans. Comput. 35(6), 568\u2013573 (1986)","journal-title":"IEEE Trans. Comput."},{"key":"508_CR22","doi-asserted-by":"publisher","unstructured":"Menouer, T., Le\u00a0Cun, B.: Anticipated dynamic load balancing strategy to parallelize constraint programming search. In: 2013 IEEE International Symposium on Parallel Distributed Processing, Workshops and Phd Forum, pp. 1771\u20131777 (2013). doi:\n                        10.1109\/IPDPSW.2013.210","DOI":"10.1109\/IPDPSW.2013.210"},{"key":"508_CR23","doi-asserted-by":"publisher","unstructured":"Menouer, T., Le\u00a0Cun, B.: A parallelization mixing or-tools\/gecode solvers on top of the Bobpp framework. In: 2013 Eighth international conference on P2P, Parallel, Grid, Cloud and Internet Computing, pp. 242\u2013246 (2013). doi:\n                        10.1109\/3PGCIC.2013.42","DOI":"10.1109\/3PGCIC.2013.42"},{"key":"508_CR24","doi-asserted-by":"publisher","unstructured":"Menouer, T., Le\u00a0Cun, B.: Adaptive N to P portfolio for solving constraint programming problems on top of the parallel Bobpp framework. In: 2014 IEEE International Parallel Distributed Processing Symposium Workshops, pp. 1531\u20131540 (2014). doi:\n                        10.1109\/IPDPSW.2014.171","DOI":"10.1109\/IPDPSW.2014.171"},{"key":"508_CR25","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1007\/BF01580583","volume":"34","author":"RH Mladineo","year":"1986","unstructured":"Mladineo, R.H.: An algorithm for finding the global maximum of a multimodal multivariate function. Math. Program. 34, 188\u2013200 (1986)","journal-title":"Math. Program."},{"key":"508_CR26","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4614-9093-7","volume-title":"Simplicial Global Optimization","author":"R Paulavi\u010dius","year":"2014","unstructured":"Paulavi\u010dius, R., \u017dilinskas, J.: Simplicial Global Optimization. Springer, New York (2014a)"},{"issue":"1","key":"508_CR27","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10898-013-0089-3","volume":"59","author":"R Paulavi\u010dius","year":"2014","unstructured":"Paulavi\u010dius, R., \u017dilinskas, J.: Simplicial Lipschitz optimization without the Lipschitz constant. J. Glob. Optim. 59(1), 23\u201340 (2014b)","journal-title":"J. Glob. Optim."},{"issue":"2","key":"508_CR28","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/s11590-009-0156-3","volume":"4","author":"R Paulavi\u010dius","year":"2010","unstructured":"Paulavi\u010dius, R., \u017dilinskas, J., Grothey, A.: Investigation of selection strategies in Branch and Bound algorithm with simplicial partitions and combination of Lipschitz bounds. Optim. Lett. 4(2), 173\u2013183 (2010)","journal-title":"Optim. Lett."},{"issue":"3","key":"508_CR29","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1080\/10556788.2010.551537","volume":"26","author":"R Paulavi\u010dius","year":"2011","unstructured":"Paulavi\u010dius, R., \u017dilinskas, J., Grothey, A.: Parallel Branch and Bound for Global Optimization with combination of Lipschitz bounds. Optim. Methods Softw. 26(3), 487\u2013498 (2011)","journal-title":"Optim. Methods Softw."},{"key":"508_CR30","first-page":"204","volume-title":"Software and Data Technologies, Communications in Computer and Information Science","author":"M Poldner","year":"2008","unstructured":"Poldner, M., Kuchen, H.: Algorithmic skeletons for Branch and Bound. In: Filipe, J., Shishkov, B., Helfert, M. (eds.) Software and Data Technologies, Communications in Computer and Information Science, vol. 10, pp. 204\u2013219. Springer, Berlin (2008)"},{"key":"508_CR31","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/0-387-23529-9_5","volume-title":"The Next Wave in Computing, Optimization, and Decision Technologies, Operations Research\/Computer Science Interfaces Series","author":"T Ralphs","year":"2005","unstructured":"Ralphs, T., Gzelsoy, M.: The symphony callable library for mixed integer programming. In: Golden, B., Raghavan, S., Wasil, E. (eds.) The Next Wave in Computing, Optimization, and Decision Technologies, Operations Research\/Computer Science Interfaces Series, vol. 29, pp. 61\u201376. Springer, Berlin (2005)"},{"key":"508_CR32","volume-title":"Intel Threading Building Blocks: Outfitting C++ for Multi-Core Processor Parallelism","author":"J Reinders","year":"2007","unstructured":"Reinders, J.: Intel Threading Building Blocks: Outfitting C++ for Multi-Core Processor Parallelism. O\u2019Reilly, Newton (2007)"},{"key":"508_CR33","doi-asserted-by":"crossref","unstructured":"Sakellariou, R., Gurd, J.R.: Compile-time minimisation of load imbalance in loop nests. In: 11th International Conference on Supercomputing, ACM, New York, ICS \u201997, pp. 277\u2013284 (1997)","DOI":"10.1145\/263580.263811"},{"key":"508_CR34","first-page":"3","volume-title":"Programming Languages and Systems in Computational Economics and Finance, Advances in Computational Economics","author":"MJ Saltzman","year":"2002","unstructured":"Saltzman, M.J.: Coin-or: an open-source library for optimization. In: Nielsen, S. (ed.) Programming Languages and Systems in Computational Economics and Finance, Advances in Computational Economics, vol. 18, pp. 3\u201332. Springer, Berlin (2002)"},{"key":"508_CR35","doi-asserted-by":"publisher","unstructured":"Todd, M.J.: The computation of fixed points and applications. Lecture Notes in Economics and Mathematical Systems, vol. 124. Springer (1976). doi:\n                        10.1007\/978-3-642-50327-6","DOI":"10.1007\/978-3-642-50327-6"},{"key":"508_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1007\/978-3-319-14313-2_27","volume-title":"Euro-Par 2014: Parallel Processing Workshops","author":"A Tousimojarad","year":"2014","unstructured":"Tousimojarad, A., Vanderbauwhede, W.: Comparison of three popular parallel programming models on the Intel Xeon Phi. In: Lopes, L., et al. (eds.) Euro-Par 2014: Parallel Processing Workshops. Lecture Notes in Computer Science, vol. 8806, pp. 314\u2013325. Springer, Berlin (2014)"},{"key":"508_CR37","unstructured":"Tschoke, S., Polzer, T.: Portable parallel branch-and-bound library user manual, library version 2.0. Tech. rep., University of Paderborn (1996). \n                        http:\/\/www2.cs.uni-paderborn.de\/cs\/ag-monien\/SOFTWARE\/PPBB\/documentation.html"},{"issue":"1","key":"508_CR38","doi-asserted-by":"crossref","first-page":"145","DOI":"10.3846\/1392-6292.2008.13.145-159","volume":"13","author":"J \u017dilinskas","year":"2008","unstructured":"\u017dilinskas, J.: Branch and Bound with simplicial partitions for Global Optimization. Math. Modell. Anal. 13(1), 145\u2013159 (2008)","journal-title":"Math. Modell. Anal."},{"issue":"2","key":"508_CR39","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/s10898-010-9624-7","volume":"54","author":"J \u017dilinskas","year":"2012","unstructured":"\u017dilinskas, J.: Parallel Branch and Bound for multidimensional scaling with city-block distances. J. Glob. Optim. 54(2), 261\u2013274 (2012)","journal-title":"J. Glob. Optim."},{"key":"508_CR40","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/0-387-23529-9_21","volume-title":"The Next Wave in Computing, Optimization, and Decision Technologies, Operations Research\/Computer Science Interfaces Series","author":"Y Xu","year":"2005","unstructured":"Xu, Y., Ralphs, T., Ladnyi, L., Saltzman, M.: Alps: a framework for implementing parallel tree search algorithms. In: Golden, B., Raghavan, S., Wasil, E. (eds.) The Next Wave in Computing, Optimization, and Decision Technologies, Operations Research\/Computer Science Interfaces Series, vol. 29, pp. 319\u2013334. Springer, Berlin (2005)"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-017-0508-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-017-0508-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-017-0508-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T17:44:05Z","timestamp":1589737445000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-017-0508-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,10]]},"references-count":40,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,11]]}},"alternative-id":["508"],"URL":"https:\/\/doi.org\/10.1007\/s10898-017-0508-y","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,3,10]]}}}