{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T16:02:59Z","timestamp":1772553779859,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":13,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,7,14]],"date-time":"2024-07-14T00:00:00Z","timestamp":1720915200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Bundesministerium f\u00fcr Bildung und Forschung","award":["13N15695"],"award-info":[{"award-number":["13N15695"]}]},{"name":"J\u00fclich Supercomputing Centre","award":["28042"],"award-info":[{"award-number":["28042"]}]},{"DOI":"10.13039\/100018693","name":"HORIZON EUROPE Framework Programme","doi-asserted-by":"publisher","award":["101080086"],"award-info":[{"award-number":["101080086"]}],"id":[{"id":"10.13039\/100018693","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Bundesministerium f\u00fcr Wirtschaft und Klimaschutz","award":["03EI1025A"],"award-info":[{"award-number":["03EI1025A"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,7,14]]},"DOI":"10.1145\/3638530.3664160","type":"proceedings-article","created":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T14:54:43Z","timestamp":1722524083000},"page":"1950-1953","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Harnessing Inferior Solutions For Superior Outcomes: Obtaining Robust Solutions From Quantum Algorithms"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3462-4941","authenticated-orcid":false,"given":"Pascal","family":"Halffmann","sequence":"first","affiliation":[{"name":"Department of Financial Mathematics, Fraunhofer Institute for Industrial Mathematics ITWM, Kaiserslautern, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-9934-4872","authenticated-orcid":false,"given":"Michael","family":"Trebing","sequence":"additional","affiliation":[{"name":"Department of Financial Mathematics, Fraunhofer Institute for Industrial Mathematics ITWM, Kaiserslautern, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3376-0589","authenticated-orcid":false,"given":"Steve","family":"Lenk","sequence":"additional","affiliation":[{"name":"Department of Cognitive Energy Systems, Fraunhofer, Fraunhofer Institute of Optronics, System Technologies and Image Exploitation Advanced System Technology branch IOSB-AST, Ilmenau, Germany"}]}],"member":"320","published-online":{"date-parts":[[2024,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1515\/9781400831050"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","unstructured":"Edward Farhi Jeffrey Goldstone and Sam Gutmann. 2014. A quantum approximate optimization algorithm. (2014). 10.48550\/ARXIV.1411.4028","DOI":"10.48550\/ARXIV.1411.4028"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.18420\/inf2023_124"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/VPPC55846.2022.10003292"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/QCE53715.2022.00105"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.18420\/inf2022_97"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2013.09.036"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-24907-5_14"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1103\/physreve.58.5355"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2019.0944"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Samantha Koretsky et al. 2021. Adapting quantum approximation optimization algorithm (qaoa) for unit commitment. (2021). arXiv: 2110.12624 [quant-ph].","DOI":"10.1109\/QCE52317.2021.00035"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","unstructured":"Debbie Lim Jo\u00e3o F. Doriguello and Patrick Rebentrost. 2023. Quantum algorithm for robust optimization via stochastic-gradient online learning. (2023). 10.48550\/ARXIV.2304.02262","DOI":"10.48550\/ARXIV.2304.02262"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976595"}],"event":{"name":"GECCO '24 Companion: Genetic and Evolutionary Computation Conference Companion","location":"Melbourne VIC Australia","acronym":"GECCO '24 Companion","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"]},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference Companion"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3638530.3664160","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3638530.3664160","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:06:12Z","timestamp":1750291572000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3638530.3664160"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,14]]},"references-count":13,"alternative-id":["10.1145\/3638530.3664160","10.1145\/3638530"],"URL":"https:\/\/doi.org\/10.1145\/3638530.3664160","relation":{},"subject":[],"published":{"date-parts":[[2024,7,14]]},"assertion":[{"value":"2024-08-01","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}