{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T13:46:41Z","timestamp":1762004801529,"version":"3.37.3"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,6,14]],"date-time":"2016-06-14T00:00:00Z","timestamp":1465862400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Deutsche Forschungsgemeinschaft (DFG)","award":["ID0EHDAE1334"],"award-info":[{"award-number":["ID0EHDAE1334"]}]},{"name":"Cells-in-Motion Cluster of Excellence (EXC 1003-CiM)","award":["ID0ENEAE1335"],"award-info":[{"award-number":["ID0ENEAE1335"]}]},{"name":"German Academic Exchange Service (DAAD)","award":["ID0ETFAE1336"],"award-info":[{"award-number":["ID0ETFAE1336"]}]},{"DOI":"10.13039\/501100003443","name":"Ministry of Education and Science of the Russian Federation","doi-asserted-by":"publisher","award":["ID0E2JAE1337"],"award-info":[{"award-number":["ID0E2JAE1337"]}],"id":[{"id":"10.13039\/501100003443","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2017,2]]},"DOI":"10.1007\/s11227-016-1784-x","type":"journal-article","created":{"date-parts":[[2016,6,14]],"date-time":"2016-06-14T06:06:57Z","timestamp":1465884417000},"page":"639-651","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["A GPU parallelization of branch-and-bound for multiproduct batch plants optimization"],"prefix":"10.1007","volume":"73","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9315-6167","authenticated-orcid":false,"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":[[2016,6,14]]},"reference":[{"issue":"3","key":"1784_CR1","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1134\/S1064230714030046","volume":"53","author":"A Borisenko","year":"2014","unstructured":"Borisenko A, Karpushkin S (2014) Hierarchy of processing equipment configuration design problems for multiproduct chemical plants. J Comput Syst Sci Int 53(3):410\u2013419. doi:\n                        10.1134\/S1064230714030046","journal-title":"J Comput Syst Sci Int"},{"key":"1784_CR2","doi-asserted-by":"publisher","unstructured":"Borisenko A, Kegel P, Gorlatch S (2011) Optimal design of multi-product batch plants using a parallel branch-and-bound method. In: Parallel computing technologies. Lecture notes in computer science, vol 6873. Springer, Berlin, pp 417\u2013430. doi:\n                        10.1007\/978-3-642-23178-0_36","DOI":"10.1007\/978-3-642-23178-0_36"},{"key":"1784_CR3","doi-asserted-by":"publisher","unstructured":"Boukedjar A, Lalami ME, El Baz D (2012) Parallel branch and bound on a CPU-GPU system. In: PDP, pp 392\u2013398. Citeseer. doi:\n                        10.1109\/PDP.2012.23","DOI":"10.1109\/PDP.2012.23"},{"issue":"1","key":"1784_CR4","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 (2012) Solving knapsack problems on GPU. Comput Oper Res 39(1):42\u201347. doi:\n                        10.1016\/j.cor.2011.03.014","journal-title":"Comput Oper Res"},{"issue":"8","key":"1784_CR5","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 (2013) Reducing thread divergence in a gpu-accelerated branch-and-bound algorithm. Concurr Comput Pract Exper 25(8):1121\u20131136. doi:\n                        10.1002\/cpe.2931","journal-title":"Concurr Comput Pract Exper"},{"issue":"4","key":"1784_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 JM (2013) A mixed integer linear programming model for simultaneous design and scheduling of flowshop plants. Appl Math Model 37(4):1652\u20131664. doi:\n                        10.1016\/j.apm.2012.04.043","journal-title":"Appl Math Model"},{"key":"1784_CR7","doi-asserted-by":"publisher","unstructured":"Han TD, Abdelrahman TS (2011) Reducing branch divergence in GPU programs. In: Proceedings of the fourth workshop on general purpose processing on graphics processing units. ACM, New York, p 3. doi:\n                        10.1145\/1964179.1964184","DOI":"10.1145\/1964179.1964184"},{"key":"1784_CR8","doi-asserted-by":"publisher","unstructured":"Hoffman K, Padberg M (2001) Combinatorial and integer optimization. In: Encyclopedia of operations research and management science. Springer, US, pp 94\u2013102. doi:\n                        10.1007\/1-4020-0611-X_129","DOI":"10.1007\/1-4020-0611-X_129"},{"key":"1784_CR9","doi-asserted-by":"publisher","unstructured":"Melab N, Chakroun I, Mezmaz M, Tuyttens D (2012) A GPU-accelerated branch-and-bound algorithm for the flow-shop scheduling problem. In: 2012 IEEE international conference on cluster computing (CLUSTER), pp 10\u201317. IEEE, New York. doi:\n                        10.1109\/CLUSTER.2012.18","DOI":"10.1109\/CLUSTER.2012.18"},{"key":"1784_CR10","doi-asserted-by":"publisher","unstructured":"Meyer X, Chopard B, Albuquerque P (2013) A branch-and-bound algorithm using multiple GPU-based LP solvers. In: 2013 20th international conference on high performance computing (HiPC). IEEE, New York, pp 129\u2013138. doi:\n                        10.1109\/HiPC.2013.6799105","DOI":"10.1109\/HiPC.2013.6799105"},{"key":"1784_CR11","doi-asserted-by":"publisher","unstructured":"Mokeddem D, Khellaf A (2009) Optimal solutions of multiproduct batch chemical process using multiobjective genetic algorithm with expert decision system. J Anal Meth Chem (2009). doi:\n                        10.1155\/2009\/927426","DOI":"10.1155\/2009\/927426"},{"key":"1784_CR12","unstructured":"NVIDIA Corporation (2012) NVIDIA\u2019s next generation CUDA compute architecture: Kepler GK110. \n                        http:\/\/www.nvidia.com\/content\/PDF\/kepler\/NVIDIA-Kepler-GK110-Architecture-Whitepaper.pdf"},{"key":"1784_CR13","unstructured":"NVIDIA Corporation (2014) CUDA C programming guide 6.5. \n                        http:\/\/docs.nvidia.com\/cuda\/pdf\/CUDA_C_Programming_Guide.pdf"},{"issue":"18","key":"1784_CR14","doi-asserted-by":"publisher","first-page":"6441","DOI":"10.1021\/ie202217v","volume":"51","author":"S Terrazas-Moreno","year":"2012","unstructured":"Terrazas-Moreno S, Grossmann IE, Wassick JM (2012) A mixed-integer linear programming model for optimizing the scheduling and assignment of tank farm operations. Ind Eng Chem Res 51(18):6441\u20136454. doi:\n                        10.1021\/ie202217v","journal-title":"Ind Eng Chem Res"},{"key":"1784_CR15","unstructured":"Vu TT, Derbel B (2014) Parallel branch-and-bound in multi-core multi-cpu multi-gpu heterogeneous environments. \n                        https:\/\/hal.inria.fr\/hal-01067662"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-016-1784-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-016-1784-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-016-1784-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-016-1784-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,1,30]],"date-time":"2017-01-30T06:30:54Z","timestamp":1485757854000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-016-1784-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,14]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,2]]}},"alternative-id":["1784"],"URL":"https:\/\/doi.org\/10.1007\/s11227-016-1784-x","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2016,6,14]]}}}