{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:44:53Z","timestamp":1742913893477,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319219080"},{"type":"electronic","value":"9783319219097"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-21909-7_33","type":"book-chapter","created":{"date-parts":[[2015,7,24]],"date-time":"2015-07-24T06:16:04Z","timestamp":1437718564000},"page":"324-337","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Parallelizing Branch-and-Bound on GPUs for Optimization of Multiproduct Batch Plants"],"prefix":"10.1007","author":[{"given":"Andrey","family":"Borisenko","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Haidl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergei","family":"Gorlatch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,7,25]]},"reference":[{"key":"33_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/978-3-642-23178-0_36","volume-title":"Parallel Computing Technologies","author":"A Borisenko","year":"2011","unstructured":"Borisenko, A., Kegel, P., Gorlatch, S.: Optimal design of multi-product batch plants using a parallel branch-and-bound method. In: Malyshkin, V. (ed.) PaCT 2011. LNCS, vol. 6873, pp. 417\u2013430. Springer, Heidelberg (2011)"},{"key":"33_CR2","doi-asserted-by":"crossref","unstructured":"Boukedjar, A., Lalami, M.E., El Baz, D.: Parallel branch and bound on a CPU-GPU system. In: PDP, pp. 392\u2013398. Citeseer (2012)","DOI":"10.1109\/PDP.2012.23"},{"issue":"1","key":"33_CR3","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.cor.2011.03.014","volume":"39","author":"V Boyer","year":"2012","unstructured":"Boyer, V., El Baz, D., Elkihel, M.: Solving knapsack problems on GPU. Comput. Oper. Res. 39(1), 42\u201347 (2012)","journal-title":"Comput. Oper. Res."},{"issue":"8","key":"33_CR4","doi-asserted-by":"publisher","first-page":"1121","DOI":"10.1002\/cpe.2931","volume":"25","author":"I Chakroun","year":"2013","unstructured":"Chakroun, I., Mezmaz, M., Melab, N., Bendjoudi, A.: Reducing thread divergence in a GPU-accelerated branch-and-bound algorithm. Concurr. Comput. Pract. Exp. 25(8), 1121\u20131136 (2013)","journal-title":"Concurr. Comput. Pract. Exp."},{"key":"33_CR5","volume-title":"CUDA Application Design and Development","author":"R Farber","year":"2011","unstructured":"Farber, R.: CUDA Application Design and Development. Elsevier, Amsterdam (2011)"},{"issue":"4","key":"33_CR6","doi-asserted-by":"publisher","first-page":"1652","DOI":"10.1016\/j.apm.2012.04.043","volume":"37","author":"Y Fumero","year":"2013","unstructured":"Fumero, Y., Corsano, G., Montagna, J.M.: A mixed integer linear programming model for simultaneous design and scheduling of flowshop plants. Appl. Math. Model. 37(4), 1652\u20131664 (2013)","journal-title":"Appl. Math. Model."},{"key":"33_CR7","doi-asserted-by":"crossref","unstructured":"Han, T.D., Abdelrahman, T.S.: Reducing branch divergence in GPU programs. In: Proceedings of the Fourth Workshop on General Purpose Processing on Graphics Processing Units, p. 3. ACM (2011)","DOI":"10.1145\/1964179.1964184"},{"key":"33_CR8","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/1-4020-0611-X_129","volume-title":"Encyclopedia of Operations Research and Management Science","author":"K Hoffman","year":"2001","unstructured":"Hoffman, K., Padberg, M.: Combinatorial and integer optimization. In: Hoffman, K.L., Padberg, M. (eds.) Encyclopedia of Operations Research and Management Science, pp. 94\u2013102. Springer, Heidelberg (2001)"},{"issue":"4","key":"33_CR9","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/s11236-005-0099-z","volume":"39","author":"E Malygin","year":"2005","unstructured":"Malygin, E., Karpushkin, S., Borisenko, A.: A mathematical model of the functioning of multiproduct chemical engineering systems. Theo. Found. Chem. Eng. 39(4), 429\u2013439 (2005)","journal-title":"Theo. Found. Chem. Eng."},{"key":"33_CR10","doi-asserted-by":"crossref","unstructured":"Melab, N., Chakroun, I., Mezmaz, M., Tuyttens, D.: A GPU-accelerated branch-and-bound algorithm for the flow-shop scheduling problem. In: IEEE International Conference on Cluster Computing (CLUSTER), pp. 10\u201317. IEEE (2012)","DOI":"10.1109\/CLUSTER.2012.18"},{"key":"33_CR11","doi-asserted-by":"crossref","unstructured":"Meyer, X., Chopard, B., Albuquerque, P.: A branch-and-boundalgorithm using multiple GPU-based LP solvers. In: 20th International Conference on HighPerformance Computing (HiPC), pp. 129\u2013138. IEEE (2013)","DOI":"10.1109\/HiPC.2013.6799105"},{"key":"33_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2009\/927426","volume":"2009","author":"D Mokeddem","year":"2009","unstructured":"Mokeddem, D., Khellaf, A.: Optimal solutions of multiproduct batch chemical process using multiobjective genetic algorithm with expert decision system. J. Anal. Meth. Chem. 2009, 1\u20139 (2009)","journal-title":"J. Anal. Meth. Chem."},{"key":"33_CR13","unstructured":"NVIDIA Corporation: CUDA C programming guide 6.5, August 2014. http:\/\/docs.nvidia.com\/cuda\/pdf\/CUDA_C_Programming_Guide.pdf"},{"key":"33_CR14","volume-title":"CUDA by Example: An Introduction to General-Purpose Gpu Programming","author":"J Sanders","year":"2010","unstructured":"Sanders, J., Kandrot, E.: CUDA by Example: An Introduction to General-Purpose Gpu Programming. Addison-Wesley Professional, Boston (2010)"},{"issue":"18","key":"33_CR15","doi-asserted-by":"publisher","first-page":"6441","DOI":"10.1021\/ie202217v","volume":"51","author":"S Terrazas-Moreno","year":"2012","unstructured":"Terrazas-Moreno, S., Grossmann, I.E., Wassick, J.M.: A mixed-integer linear programming model for optimizing the scheduling and assignment of tank farm operations. Ind. Eng. Chem. Res. 51(18), 6441\u20136454 (2012)","journal-title":"Ind. Eng. Chem. Res."},{"key":"33_CR16","unstructured":"Vu, T., Derbel, B.: Parallel branch-and-bound in multi-core multi-CPU multi-GPU heterogeneous environments (2014). https:\/\/hal.inria.fr\/hal-01067662"}],"container-title":["Lecture Notes in Computer Science","Parallel Computing Technologies"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21909-7_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T05:49:32Z","timestamp":1676958572000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21909-7_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319219080","9783319219097"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21909-7_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"25 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}