{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:16:15Z","timestamp":1750220175741,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":6,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T00:00:00Z","timestamp":1648425600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Science Foundation","award":["1911235"],"award-info":[{"award-number":["1911235"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,4,2]]},"DOI":"10.1145\/3503221.3508415","type":"proceedings-article","created":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T13:58:22Z","timestamp":1648475902000},"page":"439-440","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["A parallel branch-and-bound algorithm with history-based domination"],"prefix":"10.1145","author":[{"given":"Taspon","family":"Gonggiatgul","sequence":"first","affiliation":[{"name":"California State University"}]},{"given":"Ghassan","family":"Shobaki","sequence":"additional","affiliation":[{"name":"California State University"}]},{"given":"Pinar","family":"Muyan-\u00d6z\u00e7elik","sequence":"additional","affiliation":[{"name":"California State University"}]}],"member":"320","published-online":{"date-parts":[[2022,3,28]]},"reference":[{"volume-title":"Proceedings of the AAAI Conference on Artificial Intelligence. 1427--1434","author":"Anderson D.","key":"e_1_3_2_1_1_1","unstructured":"D. Anderson, G. Hendel, P. Le Bodic, and M. Viernickel. 2019. Clairvoyant restarts in branch-and-bound search using online tree-size estimation. In Proceedings of the AAAI Conference on Artificial Intelligence. 1427--1434."},{"key":"e_1_3_2_1_2_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--9.","DOI":"10.1109\/SSCI.2017.8280805"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2007.05.003"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.3.4.376"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-015-9725-9"},{"volume-title":"Proceedings of the 37th Annual IEEE\/ACM International Symposium on Microarchitecture. 283--293","author":"Shobaki G.","key":"e_1_3_2_1_6_1","unstructured":"G. Shobaki and K. Wilken. 2004. Optimal Superblock Scheduling Using Enumeration. In Proceedings of the 37th Annual IEEE\/ACM International Symposium on Microarchitecture. 283--293."}],"event":{"name":"PPoPP '22: 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing"],"location":"Seoul Republic of Korea","acronym":"PPoPP '22"},"container-title":["Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3503221.3508415","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3503221.3508415","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:00:49Z","timestamp":1750186849000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3503221.3508415"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,28]]},"references-count":6,"alternative-id":["10.1145\/3503221.3508415","10.1145\/3503221"],"URL":"https:\/\/doi.org\/10.1145\/3503221.3508415","relation":{},"subject":[],"published":{"date-parts":[[2022,3,28]]},"assertion":[{"value":"2022-03-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}