{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,13]],"date-time":"2025-12-13T07:20:10Z","timestamp":1765610410615,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,7,15]],"date-time":"2023-07-15T00:00:00Z","timestamp":1689379200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,7,15]]},"DOI":"10.1145\/3583133.3596415","type":"proceedings-article","created":{"date-parts":[[2023,7,24]],"date-time":"2023-07-24T23:30:33Z","timestamp":1690241433000},"page":"2224-2231","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Quantum Speed-ups for Single-machine Scheduling Problems"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9063-8048","authenticated-orcid":false,"given":"Camille","family":"Grange","sequence":"first","affiliation":[{"name":"Laboratory of Computer Science, Robotics and Microelectronics of Montpellier, Montpellier, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3641-5609","authenticated-orcid":false,"given":"Eric","family":"Bourreau","sequence":"additional","affiliation":[{"name":"Laboratory of Computer Science, Robotics and Microelectronics of Montpellier, Montpellier, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9145-2525","authenticated-orcid":false,"given":"Michael","family":"Poss","sequence":"additional","affiliation":[{"name":"Laboratory of Computer Science, Robotics and Microelectronics of Montpellier, Montpellier, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7440-2980","authenticated-orcid":false,"given":"Vincent","family":"T'Kindt","sequence":"additional","affiliation":[{"name":"Laboratory of Fundamental and Applied Computer Science of Tours, Tours, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,7,24]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"30th Annual European Symposium on Algorithms (ESA","author":"Allcock Jonathan","year":"2022","unstructured":"Jonathan Allcock , Yassine Hamoudi , Antoine Joux , Felix Klingelh\u00f6fer , and Miklos Santha . 2022 . Classical and quantum algorithms for variants of subset-sum via dynamic programming . In 30th Annual European Symposium on Algorithms (ESA 2022). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik. Jonathan Allcock, Yassine Hamoudi, Antoine Joux, Felix Klingelh\u00f6fer, and Miklos Santha. 2022. Classical and quantum algorithms for variants of subset-sum via dynamic programming. In 30th Annual European Symposium on Algorithms (ESA 2022). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.107"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1038\/s42254-021-00348-9"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9694-7"},{"key":"e_1_3_2_1_5_1","volume-title":"A quantum algorithm for finding the minimum. arXiv preprint quant-ph\/9607014","author":"Durr Christoph","year":"1996","unstructured":"Christoph Durr and Peter Hoyer . 1996. A quantum algorithm for finding the minimum. arXiv preprint quant-ph\/9607014 ( 1996 ). Christoph Durr and Peter Hoyer. 1996. A quantum algorithm for finding the minimum. arXiv preprint quant-ph\/9607014 (1996)."},{"key":"e_1_3_2_1_6_1","volume-title":"A quantum approximate optimization algorithm. arXiv preprint arXiv:1411.4028","author":"Farhi Edward","year":"2014","unstructured":"Edward Farhi , Jeffrey Goldstone , and Sam Gutmann . 2014. A quantum approximate optimization algorithm. arXiv preprint arXiv:1411.4028 ( 2014 ). Edward Farhi, Jeffrey Goldstone, and Sam Gutmann. 2014. A quantum approximate optimization algorithm. arXiv preprint arXiv:1411.4028 (2014)."},{"key":"e_1_3_2_1_7_1","volume-title":"Quantum random access memory. Physical review letters 100, 16","author":"Giovannetti Vittorio","year":"2008","unstructured":"Vittorio Giovannetti , Seth Lloyd , and Lorenzo Maccone . 2008. Quantum random access memory. Physical review letters 100, 16 ( 2008 ), 160501. Vittorio Giovannetti, Seth Lloyd, and Lorenzo Maccone. 2008. Quantum random access memory. Physical review letters 100, 16 (2008), 160501."},{"key":"e_1_3_2_1_8_1","volume-title":"An introduction to variational quantum algorithms on gate-based quantum computing for combinatorial optimization problems. arXiv preprint arXiv:2212.11734","author":"Grange Camille","year":"2022","unstructured":"Camille Grange , Michael Poss , and Eric Bourreau . 2022. An introduction to variational quantum algorithms on gate-based quantum computing for combinatorial optimization problems. arXiv preprint arXiv:2212.11734 ( 2022 ). Camille Grange, Michael Poss, and Eric Bourreau. 2022. An introduction to variational quantum algorithms on gate-based quantum computing for combinatorial optimization problems. arXiv preprint arXiv:2212.11734 (2022)."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237866"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.18.6.1138"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-58150-3_19"},{"key":"e_1_3_2_1_12_1","volume-title":"Quantum algorithms: an overview. npj Quantum Information 2, 1","author":"Montanaro Ashley","year":"2016","unstructured":"Ashley Montanaro . 2016. Quantum algorithms: an overview. npj Quantum Information 2, 1 ( 2016 ), 1--8. Ashley Montanaro. 2016. Quantum algorithms: an overview. npj Quantum Information 2, 1 (2016), 1--8."},{"key":"e_1_3_2_1_13_1","volume-title":"Fast quantum subroutines for the simplex method. Operations Research","author":"Nannicini Giacomo","year":"2022","unstructured":"Giacomo Nannicini . 2022. Fast quantum subroutines for the simplex method. Operations Research ( 2022 ). In press . Giacomo Nannicini. 2022. Fast quantum subroutines for the simplex method. Operations Research (2022). In press."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-017-0524-2"},{"key":"e_1_3_2_1_15_1","volume-title":"Exponential-time quantum algorithms for graph coloring problems. Algorithmica","author":"Shimizu Kazuya","year":"2022","unstructured":"Kazuya Shimizu and Ryuhei Mori . 2022. Exponential-time quantum algorithms for graph coloring problems. Algorithmica ( 2022 ), 1--19. Kazuya Shimizu and Ryuhei Mori. 2022. Exponential-time quantum algorithms for graph coloring problems. Algorithmica (2022), 1--19."},{"key":"e_1_3_2_1_16_1","volume-title":"Quantum speedups for convex dynamic programming. arXiv preprint arXiv:2011.11654","author":"Sutter David","year":"2020","unstructured":"David Sutter , Giacomo Nannicini , Tobias Sutter , and Stefan Woerner . 2020. Quantum speedups for convex dynamic programming. arXiv preprint arXiv:2011.11654 ( 2020 ). David Sutter, Giacomo Nannicini, Tobias Sutter, and Stefan Woerner. 2020. Quantum speedups for convex dynamic programming. arXiv preprint arXiv:2011.11654 (2020)."},{"key":"e_1_3_2_1_17_1","volume-title":"Federico Della Croce, and Mathieu Liedloff","author":"T'kindt Vincent","year":"2022","unstructured":"Vincent T'kindt , Federico Della Croce, and Mathieu Liedloff . 2022 . Moderate exponential-time algorithms for scheduling problems. 4OR (2022), 1--34. Vincent T'kindt, Federico Della Croce, and Mathieu Liedloff. 2022. Moderate exponential-time algorithms for scheduling problems. 4OR (2022), 1--34."}],"event":{"name":"GECCO '23 Companion: Companion Conference on Genetic and Evolutionary Computation","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Lisbon Portugal","acronym":"GECCO '23 Companion"},"container-title":["Proceedings of the Companion Conference on Genetic and Evolutionary Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583133.3596415","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3583133.3596415","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:48:56Z","timestamp":1750182536000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583133.3596415"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,15]]},"references-count":17,"alternative-id":["10.1145\/3583133.3596415","10.1145\/3583133"],"URL":"https:\/\/doi.org\/10.1145\/3583133.3596415","relation":{},"subject":[],"published":{"date-parts":[[2023,7,15]]},"assertion":[{"value":"2023-07-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}