{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T03:47:22Z","timestamp":1780631242179,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,8,29]],"date-time":"2022-08-29T00:00:00Z","timestamp":1661731200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Austrian Science Foundation (FWF)","award":["W1260-N35"],"award-info":[{"award-number":["W1260-N35"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,8,29]]},"DOI":"10.1145\/3547276.3548633","type":"proceedings-article","created":{"date-parts":[[2023,1,15]],"date-time":"2023-01-15T00:56:17Z","timestamp":1673744177000},"page":"1-8","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Parallel Beam Search for Combinatorial Optimization"],"prefix":"10.1145","author":[{"given":"Nikolaus","family":"Frohner","sequence":"first","affiliation":[{"name":"Institute of Logic and Computation, TU Wien, Austria"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jan","family":"Gmys","sequence":"additional","affiliation":[{"name":"University of Lille, France and INRIA Lille, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nouredine","family":"Melab","sequence":"additional","affiliation":[{"name":"University of Lille, France and INRIA Lille, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"G\u00fcnther","family":"Raidl","sequence":"additional","affiliation":[{"name":"Institute of Logic and Computation, TU Wien, Austria"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"El-Ghazali","family":"Talbi","sequence":"additional","affiliation":[{"name":"University of Lille, France and INRIA Lille, France"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,1,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1465482.1465560"},{"key":"e_1_3_2_1_2_1","volume-title":"Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. Association for Computing Machinery, 292\u2013307","author":"Archibald Blair","year":"2020","unstructured":"Blair Archibald, Patrick Maier, Robert Stewart, and Phil Trinder. 2020. YewPar: skeletons for exact combinatorial search. In PPoPP \u201920: Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. Association for Computing Machinery, 292\u2013307."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2009.02.005"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45578-7_43"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-43680-3_5"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Jan Gmys. 2022. Exactly solving hard permutation flowshop scheduling problems on peta-scale GPU-Accelerated supercomputers. in press. INFORMS Journal on Computing(2022).","DOI":"10.1287\/ijoc.2022.1193"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2020.01.039"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-010-9351-5"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2021.10.015"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1080\/00207548808947840"},{"key":"e_1_3_2_1_11_1","volume-title":"Combinatorial optimization: algorithms and complexity","author":"Papadimitriou H","unstructured":"Christos\u00a0H Papadimitriou and Kenneth Steiglitz. 1998. Combinatorial optimization: algorithms and complexity. Courier Corporation."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(93)90182-M"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-011-0237-x"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2014.07.033"},{"key":"e_1_3_2_1_15_1","volume-title":"Alps: A framework for implementing parallel tree search algorithms. In The next wave in computing, optimization, and decision technologies","author":"Xu Yan","year":"2005","unstructured":"Yan Xu, Ted\u00a0K Ralphs, Laszlo Lad\u00e1nyi, and Matthew\u00a0J Saltzman. 2005. Alps: A framework for implementing parallel tree search algorithms. In The next wave in computing, optimization, and decision technologies. Springer, 319\u2013334."}],"event":{"name":"ICPP '22: 51st International Conference on Parallel Processing","location":"Bordeaux France","acronym":"ICPP '22"},"container-title":["Workshop Proceedings of the 51st International Conference on Parallel Processing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3547276.3548633","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3547276.3548633","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:02:56Z","timestamp":1750186976000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3547276.3548633"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,29]]},"references-count":15,"alternative-id":["10.1145\/3547276.3548633","10.1145\/3547276"],"URL":"https:\/\/doi.org\/10.1145\/3547276.3548633","relation":{},"subject":[],"published":{"date-parts":[[2022,8,29]]},"assertion":[{"value":"2023-01-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}