{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:10:17Z","timestamp":1750219817087,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,8,7]],"date-time":"2023-08-07T00:00:00Z","timestamp":1691366400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1911235"],"award-info":[{"award-number":["1911235"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,8,7]]},"DOI":"10.1145\/3605731.3608929","type":"proceedings-article","created":{"date-parts":[[2023,9,7]],"date-time":"2023-09-07T23:50:00Z","timestamp":1694130600000},"page":"162-166","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Combining a Parallel Branch-and-Bound Algorithm with a Strong Heuristic to Solve the Sequential Ordering Problem"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8727-671X","authenticated-orcid":false,"given":"Ghassan","family":"Shobaki","sequence":"first","affiliation":[{"name":"Computer Science Department, California State University, Sacramento, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-8111-071X","authenticated-orcid":false,"given":"Taspon","family":"Gonggiatgul","sequence":"additional","affiliation":[{"name":"Computer Science Department, California State University, Sacramento, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-5113-6562","authenticated-orcid":false,"given":"Jacob","family":"Normington","sequence":"additional","affiliation":[{"name":"Computer Science Department, California State University, Sacramento, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6671-8483","authenticated-orcid":false,"given":"Pinar","family":"Muyan-Ozcelik","sequence":"additional","affiliation":[{"name":"Computer Science Department, California State University, Sacramento, USA"}]}],"member":"320","published-online":{"date-parts":[[2023,9,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2010.10.014"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/0803002"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008779125567"},{"volume-title":"IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW). 549\u2013558","author":"Borisenko A.","key":"e_1_3_2_1_4_1","unstructured":"A. Borisenko and S. Gorlatch. 2019. Optimal batch plants design on parallel systems: A comparative study. In IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW). 549\u2013558."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2014.06.012"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"T.G. Crainic B.\u00a0Le Cun and C. Roucairol. 2006. Parallel branch-and-bound algorithms. In Parallel Combinatorial Optimization. 1\u201328.","DOI":"10.1002\/9780470053928.ch1"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2018.02.005"},{"key":"e_1_3_2_1_8_1","series-title":"Lecture Notes in Computer Science, Vol.\u00a0980. 363\u2013377.","volume-title":"Parallel Algorithms for Irregularly Structured Problems","author":"de Bruin A.","unstructured":"A. de Bruin, G.A.P. Kindervater, and H.W.J.M. Trienekens. 1995. Asynchronous parallel branch and bound and anomalies. In Parallel Algorithms for Irregularly Structured Problems. Lecture Notes in Computer Science, Vol.\u00a0980. 363\u2013377."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(88)90333-5"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02085641"},{"key":"e_1_3_2_1_11_1","volume-title":"Operations Research Proceedings","author":"Gambardella L.M.","year":"2011","unstructured":"L.M. Gambardella, R. Montemanni, and D. Weyland. 2012. An enhanced ant colony system for the sequential ordering problem. In Operations Research Proceedings 2011. 355\u2013360."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.42.6.1042"},{"volume-title":"Heterogeneous cluster computing for many-task exact optimization - Application to permutation problems. Ph.\u00a0D. Dissertation. Universit\u00e9 de Mons (UMONS)","author":"Gmys J.","key":"e_1_3_2_1_13_1","unstructured":"J. Gmys. 2017. Heterogeneous cluster computing for many-task exact optimization - Application to permutation problems. Ph.\u00a0D. Dissertation. Universit\u00e9 de Mons (UMONS) ; Universit\u00e9 de Lille."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2020.01.039"},{"volume-title":"Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP). 439\u2013440","author":"Gonggiatgul T.","key":"e_1_3_2_1_15_1","unstructured":"T. Gonggiatgul, G. Shobaki, and P. Muyan-\u00d6z\u00e7elik. 2022. A Parallel Branch-and-Bound Algorithm with History-Based Domination. In Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP). 439\u2013440."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2022.10.007"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/1146456.1146459"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2015.04.008"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00284-2"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-009-0004-6"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"J. Jamal G. Shobaki V. Papapanagiotou L.M. Gambardella and R. Montemanni. 2017. Solving the sequential ordering problem using branch and bound. In IEEE Symposium Series on Computational Intelligence. 1\u20139.","DOI":"10.1109\/SSCI.2017.8280805"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2016.11.035"},{"volume-title":"IEEE International Parallel and Distributed Processing Symposium Workshops PhD Forum. 1769\u20131777","author":"Lalami E.","key":"e_1_3_2_1_24_1","unstructured":"M.\u00a0E. Lalami and D. El-Baz. 2012. GPU implementation of the branch and bound method for knapsack problems. In IEEE International Parallel and Distributed Processing Symposium Workshops PhD Forum. 1769\u20131777."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.21.2.498"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2742359"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.45.3.365"},{"key":"e_1_3_2_1_28_1","unstructured":"M. Mojana R. Montemanni G.D. Caro and L.M. Gambardella. 2012. A branch and bound approach for the sequential ordering problem. In Proceedings of the International Conference on Applied Operational Research. Lecture Notes in Management Science Vol.\u00a04. 266\u2013273."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2007.05.003"},{"volume-title":"IEEE conference on systems, process and control (ICSPC). 73\u201378","author":"Papapanagiotou V.","key":"e_1_3_2_1_30_1","unstructured":"V. Papapanagiotou, J. Jamal, R. Montemanni, G. Shobaki, and L.M. Gambardella. 2015. A comparison of two exact algorithms for the sequential ordering problem. In IEEE conference on systems, process and control (ICSPC). 73\u201378."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.3.4.376"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2018.06.003"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"crossref","unstructured":"Y.V. Salii and A.S. Sheka. 2020. Improving dynamic programming for travelling salesman with precedence constraints: Parallel Morin\u2013Marsten bounding. Optimization Methods and Software (2020) 1\u201327.","DOI":"10.1080\/10556788.2020.1817447"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-015-9725-9"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2017.04.012"}],"event":{"name":"ICPP-W 2023: 52nd International Conference on Parallel Processing Workshops","acronym":"ICPP-W 2023","location":"Salt Lake City UT USA"},"container-title":["Proceedings of the 52nd International Conference on Parallel Processing Workshops"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3605731.3608929","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3605731.3608929","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3605731.3608929","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:46:10Z","timestamp":1750178770000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3605731.3608929"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,7]]},"references-count":34,"alternative-id":["10.1145\/3605731.3608929","10.1145\/3605731"],"URL":"https:\/\/doi.org\/10.1145\/3605731.3608929","relation":{},"subject":[],"published":{"date-parts":[[2023,8,7]]},"assertion":[{"value":"2023-09-07","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}