{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T01:37:11Z","timestamp":1755999431639,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031066672"},{"type":"electronic","value":"9783031066689"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-06668-9_21","type":"book-chapter","created":{"date-parts":[[2022,6,5]],"date-time":"2022-06-05T23:10:29Z","timestamp":1654470629000},"page":"294-307","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Quantum Annealing Approach for Solving Hard Variants of\u00a0the\u00a0Stable Marriage Problem"],"prefix":"10.1007","author":[{"given":"Christoph","family":"Roch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Winderl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claudia","family":"Linnhoff-Popien","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastian","family":"Feld","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,6,6]]},"reference":[{"issue":"1","key":"21_CR1","doi-asserted-by":"publisher","first-page":"015002","DOI":"10.1103\/RevModPhys.90.015002","volume":"90","author":"T Albash","year":"2018","unstructured":"Albash, T., Lidar, D.A.: Adiabatic quantum computation. Rev. Mod. Phys. 90(1), 015002 (2018)","journal-title":"Rev. Mod. Phys."},{"issue":"2","key":"21_CR2","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/s10732-007-9009-3","volume":"13","author":"E Boros","year":"2007","unstructured":"Boros, E., Hammer, P.L., Tavares, G.: Local search heuristics for quadratic unconstrained binary optimization (QUBO). J. Heurist. 13(2), 99\u2013132 (2007)","journal-title":"J. Heurist."},{"key":"21_CR3","unstructured":"D-Wave Systems: D-wave announces general availability of first quantum computer built for business, September 2020. https:\/\/www.dwavesys.com\/press-releases\/d-wave-announces-general-availability-first-quantum-computer-built-business"},{"key":"21_CR4","unstructured":"D-Wave Systems Inc.: White paper: Programming the d-wave QPU: Setting the chain strength. Technical report MSU-CSE-06-2, D-Wave Systems Inc., April 2020. https:\/\/www.dwavesys.com\/sites\/default\/files\/14-1041A-A_Setting_The_Chain_Strength.pdf"},{"key":"21_CR5","doi-asserted-by":"publisher","unstructured":"Delorme, M., Garc\u00eda, S., Gondzio, J., Kalcsics, J., Manlove, D., Pettersson, W.: Mathematical models for stable matching problems with ties and incomplete lists. Eur. J. Oper. Res. 277(2), 426\u2013441 (2019). https:\/\/doi.org\/10.1016\/j.ejor.2019.03.017, http:\/\/arxiv.org\/abs\/1810.02711","DOI":"10.1016\/j.ejor.2019.03.017"},{"issue":"1","key":"21_CR6","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1080\/00029890.1962.11989827","volume":"69","author":"D Gale","year":"1962","unstructured":"Gale, D., Shapley, L.S.: College admissions and the stability of marriage. Am. Math. Mon. 69(1), 9\u201315 (1962)","journal-title":"Am. Math. Mon."},{"key":"21_CR7","unstructured":"Gent, I.P., Prosser, P.: An empirical study of the stable marriage problem with ties and incomplete lists. In: Proceedings of the 15th European Conference on Artificial Intelligence, ECAI 2002, pp. 141\u2013145. IOS Press, NLD (2002)"},{"key":"21_CR8","unstructured":"Glover, F., Kochenberger, G.: A tutorial on formulating and using QUBO models, November 2018. http:\/\/arxiv.org\/abs\/1811.11538"},{"key":"21_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-540-39658-1_26","volume-title":"Algorithms - ESA 2003","author":"MM Halld\u00f3rsson","year":"2003","unstructured":"Halld\u00f3rsson, M.M., Iwama, K., Miyazaki, S., Yanagisawa, H.: Improved approximation of the stable marriage problem. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 266\u2013277. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-39658-1_26"},{"issue":"3","key":"21_CR10","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1137\/0215048","volume":"15","author":"RW Irving","year":"1986","unstructured":"Irving, R.W., Leather, P.: The complexity of counting stable marriages. SIAM J. Comput. 15(3), 655\u2013667 (1986)","journal-title":"SIAM J. Comput."},{"key":"21_CR11","doi-asserted-by":"publisher","unstructured":"Irving, R.W., Manlove, D.F., Scott, S.: The stable marriage problem with master preference lists. Discrete Appl. Math. 156(15), 2959\u20132977 (2008). https:\/\/doi.org\/10.1016\/J.DAM.2008.01.002, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0166218X0800022X","DOI":"10.1016\/J.DAM.2008.01.002"},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"Iwama, K., Miyazaki, S.: A survey of the stable marriage problem and its variants. In: International Conference on Informatics Education and Research for Knowledge-Circulating Society (ICKS 2008), pp. 131\u2013136. IEEE (2008)","DOI":"10.1109\/ICKS.2008.7"},{"key":"21_CR13","doi-asserted-by":"publisher","unstructured":"Forrest, J.J., et al.: Coin-or\/Cbc: version 2.10.5, March 2020. https:\/\/doi.org\/10.5281\/zenodo.3700700","DOI":"10.5281\/zenodo.3700700"},{"key":"21_CR14","doi-asserted-by":"publisher","unstructured":"Kadowaki, T., Nishimori, H.: Quantum annealing in the transverse Ising model, April 1998. https:\/\/doi.org\/10.1103\/PhysRevE.58.5355, http:\/\/arxiv.org\/abs\/cond-mat\/9804280, https:\/\/dx.doi.org\/10.1103\/PhysRevE.58.5355","DOI":"10.1103\/PhysRevE.58.5355"},{"key":"21_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1007\/978-3-540-87744-8_52","volume-title":"Algorithms - ESA 2008","author":"Z Kir\u00e1ly","year":"2008","unstructured":"Kir\u00e1ly, Z.: Better and simpler approximation algorithms for the stable marriage problem. In: Halperin, D., Mehlhorn, K. (eds.) ESA 2008. LNCS, vol. 5193, pp. 623\u2013634. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-87744-8_52"},{"key":"21_CR16","doi-asserted-by":"publisher","first-page":"5","DOI":"10.3389\/fphy.2014.00005","volume":"2","author":"A Lucas","year":"2014","unstructured":"Lucas, A.: Ising formulations of many np problems. Front. Phys. 2, 5 (2014)","journal-title":"Front. Phys."},{"key":"21_CR17","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1145\/2805789.2805800","volume":"45","author":"BM Maggs","year":"2015","unstructured":"Maggs, B.M., Sitaraman, R.K.: Algorithmic nuggets in content delivery. ACM SIGCOMM Comput. Commun. Rev. 45, 52\u201366 (2015). https:\/\/doi.org\/10.1145\/2805789.2805800","journal-title":"ACM SIGCOMM Comput. Commun. Rev."},{"key":"21_CR18","doi-asserted-by":"publisher","unstructured":"Manlove, D.F., Irving, R.W., Iwama, K., Miyazaki, S., Morita, Y.: Hard variants of stable marriage. Theor. Comput. Sci. 276(1\u20132), 261\u2013279 (2002). https:\/\/doi.org\/10.1016\/s0304-3975(01)00206-7, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0304397501002067","DOI":"10.1016\/s0304-3975(01)00206-7"},{"issue":"2","key":"21_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2200\/S00585ED1V01Y201407QMC008","volume":"5","author":"CC McGeoch","year":"2014","unstructured":"McGeoch, C.C.: Adiabatic quantum computation and quantum annealing: theory and practice. Synthesis Lect. Quantum Comput. 5(2), 1\u201393 (2014). https:\/\/doi.org\/10.2200\/S00585ED1V01Y201407QMC008","journal-title":"Synthesis Lect. Quantum Comput."},{"key":"21_CR20","unstructured":"Michael Booth, S.P.R., Roy, A.: Partitioning optimization problems for hybrid classical\/quantum execution. Technical report, D-Wave System Inc., January 2017. https:\/\/www.dwavesys.com\/sites\/default\/files\/partitioning_QUBOs_for_quantum_acceleration-2.pdf"},{"key":"21_CR21","unstructured":"Podhradsk\u00fd, A.: Aproximativn\u00ed algoritmy pro probl\u00e9m stabiln\u00edho p\u00e1rov\u00e1n\u00ed (2011). https:\/\/is.muni.cz\/th\/172646\/fi_m"},{"issue":"6","key":"21_CR22","doi-asserted-by":"publisher","first-page":"991","DOI":"10.1086\/261272","volume":"92","author":"AE Roth","year":"1984","unstructured":"Roth, A.E.: The evolution of the labor market for medical interns and residents: a case study in game theory. J. Polit. Econ. 92(6), 991\u20131016 (1984)","journal-title":"J. Polit. Econ."},{"issue":"4","key":"21_CR23","doi-asserted-by":"publisher","first-page":"748","DOI":"10.1257\/aer.89.4.748","volume":"89","author":"AE Roth","year":"1999","unstructured":"Roth, A.E., Peranson, E.: The redesign of the matching market for American physicians: Some engineering aspects of economic design. Am. Econ. Rev. 89(4), 748\u2013780 (1999)","journal-title":"Am. Econ. Rev."},{"key":"21_CR24","doi-asserted-by":"crossref","unstructured":"Roth, A.E., Rothblum, U.G., Vate, J.H.V.: Stable matchings, optimal assignments, and linear programming. Math. Oper. Res. 18(4), 803\u2013828 (1993). http:\/\/www.jstor.org\/stable\/3690124","DOI":"10.1287\/moor.18.4.803"},{"key":"21_CR25","doi-asserted-by":"crossref","unstructured":"Su, J., Tu, T., He, L.: A quantum annealing approach for boolean satisfiability problem. In: Proceedings of the 53rd Annual Design Automation Conference, p. 148. ACM (2016)","DOI":"10.1145\/2897937.2897973"},{"key":"21_CR26","volume-title":"Algorithms + Data Structures = Programs","author":"N Wirth","year":"1978","unstructured":"Wirth, N.: Algorithms + Data Structures = Programs. Prentice Hall PTR, USA (1978)"}],"container-title":["Communications in Computer and Information Science","Innovations for Community Services"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-06668-9_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,5]],"date-time":"2022-06-05T23:13:31Z","timestamp":1654470811000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-06668-9_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031066672","9783031066689"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-06668-9_21","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"6 June 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"I4CS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Innovations for Community Services","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Delft","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"i4cs2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.i4cs-conference.org\/","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":"43","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":"15","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":"5","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":"3.53","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":"5.43","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)"}}]}}