{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:51:04Z","timestamp":1761897064896,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030227333"},{"type":"electronic","value":"9783030227340"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-22734-0_19","type":"book-chapter","created":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T15:02:45Z","timestamp":1559919765000},"page":"253-266","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Productivity-Aware Design and Implementation of Distributed Tree-Based Search Algorithms"],"prefix":"10.1007","author":[{"given":"Tiago","family":"Carneiro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nouredine","family":"Melab","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,6,8]]},"reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"1539","DOI":"10.1007\/978-0-387-09766-4_210","volume-title":"Encyclopedia of Parallel Computing","author":"G Almasi","year":"2011","unstructured":"Almasi, G.: PGAS (partitioned global address space) languages. In: Padua, D. (ed.) Encyclopedia of Parallel Computing, pp. 1539\u20131545. Springer, Boston (2011). https:\/\/doi.org\/10.1007\/978-0-387-09766-4_210"},{"key":"19_CR2","unstructured":"Asanovic, K., et al.: The landscape of parallel computing research: a view from Berkeley. Technical report, Technical Report UCB\/EECS-2006-183, EECS Department, University of California (2006)"},{"issue":"1","key":"19_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.disc.2007.12.043","volume":"309","author":"J Bell","year":"2009","unstructured":"Bell, J., Stevens, B.: A survey of known results and research areas for n-queens. Discrete Math. 309(1), 1\u201331 (2009)","journal-title":"Discrete Math."},{"issue":"4","key":"19_CR4","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1177\/1094342006070078","volume":"20","author":"R Bolze","year":"2006","unstructured":"Bolze, R., et al.: Grid\u20195000: a large scale and highly reconfigurable experimental grid testbed. Int. J. High Perform. Comput. Appl. 20(4), 481\u2013494 (2006)","journal-title":"Int. J. High Perform. Comput. Appl."},{"key":"19_CR5","unstructured":"Carneiro, T., de Carvalho J\u00fanior, F.H., Arruda, N.G.P.B., Pinheiro, A.B.: Um levantamento na literatura sobre a resolu\u00e7\u00e3o de problemas de otimiza\u00e7\u00e3o combinat\u00f3ria atrav\u00e9s do uso de aceleradores gr\u00e1ficos. In: Proceedings of the XXXV Ibero-Latin American Congress on Computational Methods in Engineering (CILAMCE), Fortaleza-CE, Brasil (2014)"},{"issue":"9","key":"19_CR6","doi-asserted-by":"publisher","first-page":"e4374","DOI":"10.1002\/cpe.4374","volume":"30","author":"Tiago Carneiro\u00a0Pessoa","year":"2017","unstructured":"Carneiro Pessoa, T., Gmys, J., de Carvalho Junior, F.H., Melab, N., Tuyttens, D.: GPU-accelerated backtracking using CUDA dynamic parallelism. Concurr. Comput. Pract. Exp. 30, e4374-n\/a (2017). https:\/\/doi.org\/10.1002\/cpe.4374","journal-title":"Concurrency and Computation: Practice and Experience"},{"key":"19_CR7","unstructured":"Chamberlain, B.L., Choi, S.E., Deitz, S.J., Navarro, A.: User-defined parallel zippered iterators in chapel. In: Proceedings of Fifth Conference on Partitioned Global Address Space Programming Models, pp. 1\u201311 (2011)"},{"key":"19_CR8","unstructured":"Chamberlain, B.L., et al.: Chapel comes of age: making scalable programming productive. Cray User Group (2018)"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Crainic, T., Le Cun, B., Roucairol, C.: Parallel branch-and-bound algorithms. Parallel combinatorial optimization, pp. 1\u201328 (2006)","DOI":"10.1002\/9780470053928.ch1"},{"key":"19_CR10","unstructured":"Cray Inc.: Chapel language specification, vol. 986. Cray Inc. (2018)"},{"issue":"2","key":"19_CR11","first-page":"6","volume":"2","author":"G Da Costa","year":"2015","unstructured":"Da Costa, G., et al.: Exascale machines require new programming paradigms and runtimes. Supercomput. Front. Innov. 2(2), 6\u201327 (2015)","journal-title":"Supercomput. Front. Innov."},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Feinbube, F., Rabe, B., von L\u00f6wis, M., Polze, A.: NQueens on CUDA: optimization issues. In: 2010 Ninth International Symposium on Parallel and Distributed Computing (ISPDC), pp. 63\u201370. IEEE (2010)","DOI":"10.1109\/ISPDC.2010.22"},{"key":"19_CR13","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1016\/j.future.2018.01.034","volume":"82","author":"S Fiore","year":"2018","unstructured":"Fiore, S., Bakhouya, M., Smari, W.W.: On the road to exascale: advances in high performance computing and simulations\u2013an overview and editorial. Future Gener. Comput. Syst. 82, 450\u2013458 (2018)","journal-title":"Future Gener. Comput. Syst."},{"issue":"9","key":"19_CR14","doi-asserted-by":"publisher","first-page":"e4019","DOI":"10.1002\/cpe.4019","volume":"29","author":"J Gmys","year":"2017","unstructured":"Gmys, J., Mezmaz, M., Melab, N., Tuyttens, D.: IVM-based parallel branch-and-bound using hierarchical work stealing on multi-GPU systems. Concurr. Comput. Pract. Exp. 29(9), e4019 (2017)","journal-title":"Concurr. Comput. Pract. Exp."},{"key":"19_CR15","unstructured":"Grama, A.Y., Kumar, V.: A survey of parallel search algorithms for discrete optimization problems. ORSA J. Comput. 7 (1993). https:\/\/doi.org\/10.1.1.45.9937"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Mezmaz, M., Melab, N., Talbi, E.G.: A grid-enabled branch and bound algorithm for solving challenging combinatorial optimization problems. In: IEEE International Parallel and Distributed Processing Symposium, IPDPS 2007, pp. 1\u20139. IEEE (2007)","DOI":"10.1109\/IPDPS.2007.370217"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"San Segundo, P., Rossi, C., Rodriguez-Losada, D.: Recent developments in bit-parallel algorithms. INTECH Open Access Publisher (2008)","DOI":"10.5772\/6076"},{"key":"19_CR18","unstructured":"Tschoke, S., Lubling, R., Monien, B.: Solving the traveling salesman problem with a distributed branch-and-bound algorithm on a 1024 processor network. In: 9th International Parallel Processing Symposium. Proceedings, pp. 182\u2013189. IEEE (1995)"},{"key":"19_CR19","unstructured":"Zhang, W.: Branch-and-bound search algorithms and their computational complexity. Technical report, DTIC Document (1996)"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2019"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-22734-0_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,7]],"date-time":"2023-06-07T00:58:51Z","timestamp":1686099531000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-22734-0_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030227333","9783030227340"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-22734-0_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"8 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Faro","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-computsci2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccs-meeting.org\/iccs2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}