{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T00:26:14Z","timestamp":1771547174400,"version":"3.50.1"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030589417","type":"print"},{"value":"9783030589424","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-58942-4_8","type":"book-chapter","created":{"date-parts":[[2020,9,18]],"date-time":"2020-09-18T06:03:58Z","timestamp":1600409038000},"page":"112-129","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["Integer Programming Techniques for Minor-Embedding in Quantum Annealers"],"prefix":"10.1007","author":[{"given":"David E.","family":"Bernal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kyle E. C.","family":"Booth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raouf","family":"Dridi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hedayat","family":"Alghassi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sridhar","family":"Tayur","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Davide","family":"Venturelli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,9,19]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"56","DOI":"10.3389\/fphy.2014.00056","volume":"2","author":"Z Bian","year":"2014","unstructured":"Bian, Z., Chudak, F., Israel, R., Lackey, B., Macready, W.G., Roy, A.: Discrete optimization using quantum annealing on sparse Ising models. Front. Phys. 2, 56 (2014)","journal-title":"Front. Phys."},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Bixby, R.E.: A brief history of linear and mixed-integer programming computation. Documenta Mathematica $$\\cdot $$ Extra (2012)","DOI":"10.4171\/dms\/6\/16"},{"issue":"4","key":"8_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TASC.2014.2318294","volume":"24","author":"PI Bunyk","year":"2014","unstructured":"Bunyk, P.I., et al.: Architectural considerations in the design of a superconducting quantum annealing processor. IEEE Trans. Appl. Superconductivity 24(4), 1\u201310 (2014)","journal-title":"IEEE Trans. Appl. Superconductivity"},{"key":"8_CR4","unstructured":"Cai, J., Macready, W.G., Roy, A.: A practical heuristic for finding graph minors. arXiv:1406.2741 (2014)"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Choi, V.: Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design. Quant. Inf. Process. 10(3), 343\u2013353 (2011)","DOI":"10.1007\/s11128-010-0200-3"},{"key":"8_CR6","unstructured":"Cplex: 12.9 user\u2019s manual (2019)"},{"issue":"4","key":"8_CR7","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/s11128-019-2236-3","volume":"18","author":"P Date","year":"2019","unstructured":"Date, P., Patton, R., Schuman, C., Potok, T.: Efficiently embedding qubo problems on adiabatic quantum computers. Quant. Inf. Process. 18(4), 117 (2019)","journal-title":"Quant. Inf. Process."},{"key":"8_CR8","unstructured":"Dattani, N., Chancellor, N.: Embedding quadratization gadgets on Chimera and Pegasus graphs. arXiv:1901.07676 (2019)"},{"key":"8_CR9","unstructured":"Dridi, R., Alghassi, H., Tayur, S.: A novel algebraic geometry compiling framework for adiabatic quantum computations. arXiv:1810.01440 (2018)"},{"issue":"13","key":"8_CR10","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/S0022-4049(99)00005-5","volume":"139","author":"JC Faug\u00e8re","year":"1999","unstructured":"Faug\u00e8re, J.C.: A new efficient algorithm for computing Gr\u00f6bner bases (F4). J. Pure Appl. Algebra 139(13), 61\u201388 (1999)","journal-title":"J. Pure Appl. Algebra"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Faug\u00e8re, J.C.: A new efficient algorithm for computing Gr\u00f6bner bases without reduction to zero (F5). In: Proceedings of the 2002 International Symposium on Symbolic and Algebraic Computation, ISSAC 2002, pp. 75\u201383. ACM, New York (2002)","DOI":"10.1145\/780506.780516"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Forrest, J., Lougee-Heimer, R.: CBC user guide. In: Emerging Theory, Methods, and Applications (2005)","DOI":"10.1287\/educ.1053.0020"},{"issue":"4","key":"8_CR13","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/BF00934810","volume":"10","author":"AM Geoffrion","year":"1972","unstructured":"Geoffrion, A.M.: Generalized benders decomposition. J. Optim. Theory Appl. 10(4), 237\u2013260 (1972)","journal-title":"J. Optim. Theory Appl."},{"issue":"5","key":"8_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11128-018-1863-4","volume":"17","author":"TD Goodrich","year":"2018","unstructured":"Goodrich, T.D., Sullivan, B.D., Humble, T.S.: Optimizing adiabatic quantum program compilation using a graph-theoretic framework. Quant. Inf. Process. 17(5), 1\u201326 (2018). https:\/\/doi.org\/10.1007\/s11128-018-1863-4","journal-title":"Quant. Inf. Process."},{"key":"8_CR15","unstructured":"Gurobi Optimization, L.: Gurobi optimizer reference manual (2019)"},{"key":"8_CR16","doi-asserted-by":"publisher","unstructured":"Hart, W.E., et al.: Pyomo-Optimization Modeling in Python, vol. 67. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-319-58821-6","DOI":"10.1007\/978-3-319-58821-6"},{"issue":"1","key":"8_CR17","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s10107-003-0375-9","volume":"96","author":"JN Hooker","year":"2003","unstructured":"Hooker, J.N., Ottosson, G.: Logic-based Benders decomposition. Math. Program. 96(1), 33\u201360 (2003)","journal-title":"Math. Program."},{"issue":"7346","key":"8_CR18","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1038\/nature10012","volume":"473","author":"MW Johnson","year":"2011","unstructured":"Johnson, M.W., et al.: Quantum annealing with manufactured spins. Nature 473(7346), 194\u2013198 (2011)","journal-title":"Nature"},{"key":"8_CR19","doi-asserted-by":"publisher","unstructured":"Kaminsky, W.M., Lloyd, S.: Scalable architecture for adiabatic quantum computing of NP-hard problems. In: Leggett, A.J., Ruggiero, B., Silvestrini, P. (eds.) Quantum Computing and Quantum Bits in Mesoscopic Systems, pp. 229\u2013236. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-1-4419-9092-1_25","DOI":"10.1007\/978-1-4419-9092-1_25"},{"key":"8_CR20","unstructured":"Maplesoft: Algorithms for Groebner basis, Maple 2017 (2019)"},{"key":"8_CR21","doi-asserted-by":"publisher","unstructured":"Mittelmann, H.D.: Benchmarking optimization software - a (hi)story. SN Oper. Res. Forum 1(1), 2 (2020). ISSN 2662\u20132556, https:\/\/doi.org\/10.1007\/s43069-020-0002-0","DOI":"10.1007\/s43069-020-0002-0"},{"key":"8_CR22","unstructured":"Neven, H., Denchev, V.S., Drew-Brook, M., Zhang, J., Macready, W.G., Rose, G.: NIPS 2009 demonstration: binary classification using hardware implementation of quantum annealing (2009)"},{"issue":"1","key":"8_CR23","doi-asserted-by":"publisher","first-page":"2098","DOI":"10.1038\/s41598-018-38388-4","volume":"9","author":"S Okada","year":"2019","unstructured":"Okada, S., Ohzeki, M., Terabe, M., Taguchi, S.: Improving solutions by embedding larger subproblems in a D-wave quantum annealer. Sci. Rep. 9(1), 2098 (2019)","journal-title":"Sci. Rep."},{"key":"8_CR24","doi-asserted-by":"crossref","unstructured":"Oki, E.: GLPK (GNU Linear Programming Kit). In: Linear Programming and Algorithms for Communication Networks (2012)","DOI":"10.1201\/b12733"},{"key":"8_CR25","doi-asserted-by":"crossref","unstructured":"Perdomo-Ortiz, A., Dickson, N., Drew-Brook, M., Rose, G., Aspuru-Guzik, A.: Finding low-energy conformations of lattice protein models by quantum annealing. Sci. Rep. (2012)","DOI":"10.1038\/srep00571"},{"key":"8_CR26","doi-asserted-by":"crossref","unstructured":"Rieffel, E.G., et al.: From Ans\u00e4tze to Z-gates: a NASA View of Quantum Computing. arXiv:1905.02860 (2019)","DOI":"10.3233\/APC190010"},{"key":"8_CR27","doi-asserted-by":"crossref","unstructured":"Roshanaei, V., Booth, K.E.C., Aleman, D.M., Urbach, D.R., Beck, J.C.: Branch-and-check methods for multi-level operating room planning and scheduling. Int. J. Prod. Econ. (2019)","DOI":"10.1016\/j.ijpe.2019.07.006"},{"key":"8_CR28","unstructured":"Serra, T., Huang, T., Raghunathan, A., Bergman, D.: Template-based Minor Embedding for Adiabatic Quantum Optimization. arXiv:1910.02179 (2019)"},{"key":"8_CR29","doi-asserted-by":"publisher","unstructured":"Sugie, Y., et al.: Graph minors from simulated annealing for annealing machines with sparse connectivity. In: Fagan, D., Mart\u00edn-Vide, C., O\u2019Neill, M., Vega-Rodr\u00edguez, M.A. (eds.) TPNC 2018. LNCS, vol. 11324, pp. 111\u2013123. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-04070-3_9","DOI":"10.1007\/978-3-030-04070-3_9"},{"issue":"July","key":"8_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3084688","volume":"2017","author":"W Tichy","year":"2017","unstructured":"Tichy, W.: Is quantum computing for real? An interview with Catherine McGeoch of D-wave systems. Ubiquity 2017(July), 1\u201320 (2017)","journal-title":"Ubiquity"},{"issue":"2","key":"8_CR31","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1080\/00107514.2018.1450720","volume":"59","author":"SE Venegas-Andraca","year":"2018","unstructured":"Venegas-Andraca, S.E., Cruz-Santos, W., McGeoch, C., Lanzagorta, M.: A cross-disciplinary introduction to quantum annealing-based algorithms. Contemp. Phys. 59(2), 174\u2013197 (2018)","journal-title":"Contemp. Phys."},{"key":"8_CR32","unstructured":"Yang, Z., Dinneen, M.J.: Graph minor embeddings for D-wave computer architecture. Technical report, Department of Computer Science, The University of Auckland, New Zealand (2016)"}],"container-title":["Lecture Notes in Computer Science","Integration of Constraint Programming, Artificial Intelligence, and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58942-4_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,7]],"date-time":"2023-10-07T13:56:18Z","timestamp":1696686978000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-58942-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030589417","9783030589424"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58942-4_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"19 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CPAIOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vienna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cpaior2020.dbai.tuwien.ac.at\/","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":"72","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":"25","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":"7","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.08","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.08","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)"}}]}}