{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T04:36:45Z","timestamp":1743050205676,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031360299"},{"type":"electronic","value":"9783031360305"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-36030-5_10","type":"book-chapter","created":{"date-parts":[[2023,6,28]],"date-time":"2023-06-28T17:02:13Z","timestamp":1687971733000},"page":"124-137","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Software Aided Approach for\u00a0Constrained Optimization Based on\u00a0QAOA Modifications"],"prefix":"10.1007","author":[{"given":"Tomasz","family":"Lam\u017ca","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3189-7618","authenticated-orcid":false,"given":"Justyna","family":"Zawalska","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mariusz","family":"Sterzel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8032-7251","authenticated-orcid":false,"given":"Katarzyna","family":"Rycerz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,6,26]]},"reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-031-04148-8_11","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"M Ayodele","year":"2022","unstructured":"Ayodele, M.: Penalty weights in\u00a0QUBO formulations: permutation problems. In: P\u00e9rez C\u00e1ceres, L., Verel, S. (eds.) EvoCOP 2022. LNCS, vol. 13222, pp. 159\u2013174. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-04148-8_11"},{"key":"10_CR2","doi-asserted-by":"publisher","unstructured":"B\u00e4rtschi, A., Eidenbenz, S.: Grover Mixers for QAOA: shifting complexity from mixer design to state preparation. In: 2020 IEEE International Conference on Quantum Computing and Engineering (QCE), pp. 72\u201382 (Oct 2020). https:\/\/doi.org\/10.1109\/QCE49297.2020.00020, arXiv:2006.00354 [quant-ph]","DOI":"10.1109\/QCE49297.2020.00020"},{"key":"10_CR3","doi-asserted-by":"publisher","unstructured":"Endres, S.C., Sandrock, C., Focke, W.W.: A simplicial homology algorithm for Lipschitz optimisation. J. Global Optim. 72(2), 181\u2013217 (2018). https:\/\/doi.org\/10.1007\/s10898-018-0645-y, http:\/\/link.springer.com\/10.1007\/s10898-018-0645-y","DOI":"10.1007\/s10898-018-0645-y"},{"key":"10_CR4","unstructured":"Farhi, E., Goldstone, J., Gutmann, S.: A Quantum Approximate Optimization Algorithm, arXiv:1411.4028 (Nov 2014), [quant-ph]"},{"key":"10_CR5","doi-asserted-by":"publisher","unstructured":"Fuchs, F.G., Lye, K.O., Nilsen, H.M., Stasik, A.J., Sartor, G.: Constrained mixers for the quantum approximate optimization algorithm. Algorithms 15(6), 202 (2022). https:\/\/doi.org\/10.3390\/a15060202, arXiv:2203.06095 [quant-ph]","DOI":"10.3390\/a15060202"},{"key":"10_CR6","unstructured":"Golden, J., B\u00e4rtschi, A., Eidenbenz, S., O\u2019Malley, D.: Evidence for Super-Polynomial Advantage of QAOA over Unstructured Search (Feb 2022), arXiv: 2202.00648 [quant-ph]"},{"key":"10_CR7","doi-asserted-by":"publisher","unstructured":"Hadfield, S., Wang, Z., O\u2019Gorman, B., Rieffel, E.G., Venturelli, D., Biswas, R.: From the quantum approximate optimization algorithm to a quantum alternating operator ansatz. Algorithms 12(2), 34 (2019). https:\/\/doi.org\/10.3390\/a12020034, arXiv:1709.03489 [quant-ph]","DOI":"10.3390\/a1202003"},{"key":"10_CR8","doi-asserted-by":"publisher","unstructured":"Hadfield, S., Wang, Z., Rieffel, E.G., O\u2019Gorman, B., Venturelli, D., Biswas, R.: Quantum approximate optimization with hard and soft constraints. In: Proceedings of the Second International Workshop on Post Moores Era Supercomputing, Denver CO USA, pp. 15\u201321. ACM (Nov 2017). https:\/\/doi.org\/10.1145\/3149526.3149530, https:\/\/dl.acm.org\/doi\/10.1145\/3149526.3149530","DOI":"10.1145\/3149526.3149530"},{"key":"10_CR9","doi-asserted-by":"publisher","unstructured":"Lucas, A.: Ising formulations of many NP problems. Front. Phys. 2 (2014). https:\/\/doi.org\/10.3389\/fphy.2014.00005, arXiv:1302.5843 [cond-mat, physics:quant-ph]","DOI":"10.3389\/fphy.2014.00005"},{"key":"10_CR10","unstructured":"Mesman, K., Al-Ars, Z., M\u00f6ller, M.: QPack: Quantum Approximate Optimization Algorithms as universal benchmark for quantum computers (Apr 2022), arXiv:2103.17193 [quant-ph]"},{"key":"10_CR11","doi-asserted-by":"publisher","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization. Springer Series in Operations Research and Financial Engineering. Springer, New York (2006). https:\/\/doi.org\/10.1007\/978-0-387-40065-5, http:\/\/link.springer.com\/10.1007\/978-0-387-40065-5","DOI":"10.1007\/978-0-387-40065-5"},{"key":"10_CR12","doi-asserted-by":"publisher","unstructured":"Olson, B., Hashmi, I., Molloy, K., Shehu, A.: Basin hopping as a general and versatile optimization framework for the characterization of biological macromolecules. Adv. Artif. Intell. 2012, 1\u201319 (2012). https:\/\/doi.org\/10.1155\/2012\/674832, https:\/\/www.hindawi.com\/journals\/aai\/2012\/674832\/","DOI":"10.1155\/2012\/674832"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"Parizy, M., Kakuko, N., Togawa, N.: Fast Hyperparameter Tuning for Ising Machines (Nov 2022), arXiv:2211.15869 [cs]","DOI":"10.1109\/ICCE56470.2023.10043382"},{"key":"10_CR14","unstructured":"Radha, S.K.: Quantum constraint learning for quantum approximate optimization algorithm (Dec 2021). arXiv:2105.06770 [physics, physics:quant-ph]"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Roch, C., Impertro, A., Phan, T., Gabor, T., Feld, S., Linnhoff-Popien, C.: Cross Entropy Hyperparameter Optimization for Constrained Problem Hamiltonians Applied to QAOA (Aug 2020). arXiv:2003.05292 [quant-ph]","DOI":"10.1109\/ICRC2020.2020.00009"},{"key":"10_CR16","doi-asserted-by":"publisher","unstructured":"Tilly, J., et al.: The Variational Quantum Eigensolver: A review of methods and best practices. Phys. Reports 986, 1\u2013128 (2022). https:\/\/doi.org\/10.1016\/j.physrep.2022.08.003, https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0370157322003118","DOI":"10.1016\/j.physrep.2022.08.003"},{"key":"10_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1007\/978-3-030-50433-5_40","volume-title":"Computational Science \u2013 ICCS 2020","author":"D Tomasiewicz","year":"2020","unstructured":"Tomasiewicz, D., Pawlik, M., Malawski, M., Rycerz, K.: Foundations for workflow application scheduling on D-wave system. In: Krzhizhanovskaya, V.V., et al. (eds.) ICCS 2020. LNCS, vol. 12142, pp. 516\u2013530. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-50433-5_40"},{"key":"10_CR18","doi-asserted-by":"publisher","unstructured":"Wales, D.J., Doye, J.P.K.: Global optimization by basin-hopping and the lowest energy structures of lennard-jones clusters containing up to 110 atoms. J. Phys. Chem. A 101(28), 5111\u20135116 (1997). https:\/\/doi.org\/10.1021\/jp970984n, https:\/\/pubs.acs.org\/doi\/10.1021\/jp970984n","DOI":"10.1021\/jp970984n"},{"key":"10_CR19","doi-asserted-by":"publisher","unstructured":"Wang, Z., Rubin, N.C., Dominy, J.M., Rieffel, E.G.: \\$XY\\$-mixers: analytical and numerical results for QAOA. Phys. Rev. A 101(1), 012320 (2020). https:\/\/doi.org\/10.1103\/PhysRevA.101.012320, arXiv:1904.09314 [quant-ph]","DOI":"10.1103\/PhysRevA.101.012320"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-36030-5_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,24]],"date-time":"2024-05-24T01:03:28Z","timestamp":1716512608000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-36030-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031360299","9783031360305"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-36030-5_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"26 June 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":".","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code available at"}},{"value":"ICCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-computsci2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccs-meeting.org\/iccs2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"530","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"188","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"94","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2,8","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3,2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}