{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T15:34:38Z","timestamp":1778168078363,"version":"3.51.4"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030192112","type":"print"},{"value":"9783030192129","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-19212-9_43","type":"book-chapter","created":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T10:32:32Z","timestamp":1558348352000},"page":"643-660","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Quadratic Reformulation of Nonlinear Pseudo-Boolean Functions via the Constraint Composite Graph"],"prefix":"10.1007","author":[{"given":"Ka Wa","family":"Yip","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7874-4518","authenticated-orcid":false,"given":"Hong","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sven","family":"Koenig","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T. K. Satish","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,28]]},"reference":[{"issue":"1","key":"43_CR1","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1613\/jair.3653","volume":"45","author":"I Ab\u00edo","year":"2012","unstructured":"Ab\u00edo, I., Nieuwenhuis, R., Oliveras, A., Rodr\u00edguez-Carbonell, E., Mayer-Eichberger, V.: A new look at BDDs for Pseudo-Boolean constraints. J. Artif. Intell. Res. 45(1), 443\u2013480 (2012)","journal-title":"J. Artif. Intell. Res."},{"issue":"5","key":"43_CR2","doi-asserted-by":"publisher","first-page":"812","DOI":"10.1016\/j.camwa.2008.10.081","volume":"57","author":"BF AlBdaiwi","year":"2009","unstructured":"AlBdaiwi, B.F., Goldengorin, B., Sierksma, G.: Equivalent instances of the simple plant location problem. Comput. Math. Appl. 57(5), 812\u2013820 (2009)","journal-title":"Comput. Math. Appl."},{"key":"43_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.dam.2016.01.001","volume":"203","author":"M Anthony","year":"2016","unstructured":"Anthony, M., Boros, E., Crama, Y., Gruber, A.: Quadratization of symmetric Pseudo-Boolean functions. Discrete Appl. Math. 203, 1\u201312 (2016). \n                    https:\/\/doi.org\/10.1016\/j.dam.2016.01.001","journal-title":"Discrete Appl. Math."},{"issue":"1\u20132","key":"43_CR4","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s10107-016-1032-4","volume":"162","author":"M Anthony","year":"2017","unstructured":"Anthony, M., Boros, E., Crama, Y., Gruber, A.: Quadratic reformulations of nonlinear binary optimization problems. Math. Program. 162(1\u20132), 115\u2013144 (2017). \n                    https:\/\/doi.org\/10.1007\/s10107-016-1032-4","journal-title":"Math. Program."},{"key":"43_CR5","first-page":"43","volume":"11","author":"V Beresnev","year":"1973","unstructured":"Beresnev, V.: On a problem of mathematical standardization theory. Upr. Sistemy 11, 43\u201354 (1973). (in Russian)","journal-title":"Upr. Sistemy"},{"key":"43_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/978-3-642-02777-2_40","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2009","author":"T Berthold","year":"2009","unstructured":"Berthold, T., Heinz, S., Pfetsch, M.E.: Nonlinear Pseudo-Boolean optimization: relaxation or propagation? In: Kullmann, O. (ed.) SAT 2009. LNCS, vol. 5584, pp. 441\u2013446. Springer, Heidelberg (2009). \n                    https:\/\/doi.org\/10.1007\/978-3-642-02777-2_40"},{"key":"43_CR7","doi-asserted-by":"crossref","unstructured":"Bockmayr, A.: Logic programming with Pseudo-Boolean constraints. In: Constraint Logic Programming, pp. 327\u2013350 (1993)","DOI":"10.1007\/978-3-662-12629-5_74"},{"key":"43_CR8","doi-asserted-by":"publisher","unstructured":"Bofill, M., Coll, J., Suy, J., Villaret, M.: Compact MDDs for Pseudo-Boolean constraints with at-most-one relations in resource-constrained scheduling problems. In: International Joint Conference on Artificial Intelligence, pp. 555\u2013562 (2017). \n                    https:\/\/doi.org\/10.24963\/ijcai.2017\/78","DOI":"10.24963\/ijcai.2017\/78"},{"key":"43_CR9","unstructured":"Boros, E., Crama, Y., Rodr\u00edguez-Heck, E.: Quadratizations of symmetric Pseudo-Boolean functions: Sub-linear bounds on the number of auxiliary variables. In: International Symposium on Artificial Intelligence and Mathematics (2018). \n                    http:\/\/isaim2018.cs.virginia.edu\/papers\/ISAIM2018_Boolean_Boros_etal.pdf"},{"key":"43_CR10","unstructured":"Boros, E., Gruber, A.: On quadratization of Pseudo-Boolean functions (2014). arXiv preprint: \n                    arXiv:1404.6538"},{"issue":"1\u20133","key":"43_CR11","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/S0166-218X(98)00114-0","volume":"90","author":"E Boros","year":"1999","unstructured":"Boros, E., Hammer, P.L., Minoux, M., Rader Jr., D.J.: Optimal cell flipping to minimize channel density in VLSI design and Pseudo-Boolean optimization. Discrete Appl. Math. 90(1\u20133), 69\u201388 (1999)","journal-title":"Discrete Appl. Math."},{"issue":"5","key":"43_CR12","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s11128-008-0082-9","volume":"7","author":"V Choi","year":"2008","unstructured":"Choi, V.: Minor-embedding in adiabatic quantum computation: I. The parameter setting problem. Quantum Inf. Process. 7(5), 193\u2013209 (2008). \n                    https:\/\/doi.org\/10.1007\/s11128-008-0082-9","journal-title":"Quantum Inf. Process."},{"key":"43_CR13","first-page":"1","volume":"2","author":"N E\u00e9n","year":"2006","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: Translating Pseudo-Boolean constraints into SAT. J. Satisf. Boolean Model. Comput. 2, 1\u201326 (2006)","journal-title":"J. Satisf. Boolean Model. Comput."},{"key":"43_CR14","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/978-3-030-03098-8_7","volume-title":"PRIMA 2018: Principles and Practice of Multi-Agent Systems","author":"F Fioretto","year":"2018","unstructured":"Fioretto, F., Xu, H., Koenig, S., Kumar, T.K.S.: Solving multiagent constraint optimization problems on the constraint composite graph. In: Miller, T., et al. (eds.) PRIMA 2018. LNCS (LNAI), vol. 11224, pp. 106\u2013122. Springer, Cham (2018). \n                    https:\/\/doi.org\/10.1007\/978-3-030-03098-8_7"},{"issue":"1","key":"43_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/opre.14.1.1","volume":"14","author":"RJ Freeman","year":"1966","unstructured":"Freeman, R.J., Gogerty, D.C., Graves, G.W., Brooks, R.B.: A mathematical model of supply support for space operations. Oper. Res. 14(1), 1\u201315 (1966)","journal-title":"Oper. Res."},{"issue":"1","key":"43_CR16","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1287\/opre.22.1.180","volume":"22","author":"F Glover","year":"1974","unstructured":"Glover, F., Woolsey, E.: Converting the 0-1 polynomial programming problem to a 0-1 linear program. Oper. Res. 22(1), 180\u2013182 (1974)","journal-title":"Oper. Res."},{"key":"43_CR17","unstructured":"Gruber, A.G.: Algorithmic and complexity results for Boolean and Pseudo-Boolean functions. Ph.D. thesis, Rutgers University-Graduate School-New Brunswick (2015)"},{"key":"43_CR18","volume-title":"Boolean Methods in Operations Research and Related Areas","author":"PL Hammer","year":"2012","unstructured":"Hammer, P.L., Rudeanu, S.: Boolean Methods in Operations Research and Related Areas, vol. 7. Springer, Heidelberg (2012)"},{"key":"43_CR19","first-page":"330","volume":"6","author":"P Hammer","year":"1968","unstructured":"Hammer, P.: Plant location \u2013 a Pseudo-Boolean approach. Isr. J. Technol. 6, 330\u2013332 (1968)","journal-title":"Isr. J. Technol."},{"key":"43_CR20","unstructured":"Hansen, P., Kochetov, Y., Mladenovi, N.: Lower bounds for the uncapacitated facility location problem with user preferences. Groupe d\u2019\u00e9tudes et de recherche en analyse des d\u00e9cisions, HEC Montr\u00e9al (2004)"},{"issue":"6","key":"43_CR21","doi-asserted-by":"publisher","first-page":"1234","DOI":"10.1109\/TPAMI.2010.91","volume":"33","author":"H Ishikawa","year":"2011","unstructured":"Ishikawa, H.: Transformation of general binary MRF minimization to the first-order case. IEEE Trans. Pattern Anal. Mach. Intell. 33(6), 1234\u20131249 (2011). \n                    https:\/\/doi.org\/10.1109\/TPAMI.2010.91","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"43_CR22","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, 194\u2013198 (2011). \n                    https:\/\/doi.org\/10.1038\/nature10012","journal-title":"Nature"},{"key":"43_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/978-3-319-23219-5_15","volume-title":"Principles and Practice of Constraint Programming","author":"S Joshi","year":"2015","unstructured":"Joshi, S., Martins, R., Manquinho, V.: Generalized totalizer encoding for Pseudo-Boolean constraints. In: Pesant, G. (ed.) CP 2015. LNCS, vol. 9255, pp. 200\u2013209. Springer, Cham (2015). \n                    https:\/\/doi.org\/10.1007\/978-3-319-23219-5_15"},{"key":"43_CR24","doi-asserted-by":"publisher","unstructured":"Kahl, F., Strandmark, P.: Generalized roof duality for Pseudo-Boolean optimization. In: International Conference on Computer Vision, pp. 255\u2013262 (2011). \n                    https:\/\/doi.org\/10.1109\/ICCV.2011.6126250","DOI":"10.1109\/ICCV.2011.6126250"},{"issue":"4598","key":"43_CR25","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671\u2013680 (1983)","journal-title":"Science"},{"issue":"7","key":"43_CR26","doi-asserted-by":"publisher","first-page":"1274","DOI":"10.1109\/TPAMI.2007.1031","volume":"29","author":"V Kolmogorov","year":"2007","unstructured":"Kolmogorov, V., Rother, C.: Minimizing nonsubmodular functions with graph cuts \u2013 a review. IEEE Trans. Pattern Anal. Mach. Intell. 29(7), 1274\u20131279 (2007). \n                    https:\/\/doi.org\/10.1109\/TPAMI.2007.1031","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"43_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"664","DOI":"10.1007\/978-3-540-45193-8_45","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"TKS Kumar","year":"2003","unstructured":"Kumar, T.K.S.: Incremental computation of resource-envelopes in producer-consumer models. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 664\u2013678. Springer, Heidelberg (2003). \n                    https:\/\/doi.org\/10.1007\/978-3-540-45193-8_45"},{"key":"43_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/978-3-540-85958-1_19","volume-title":"Principles and Practice of Constraint Programming","author":"TKS Kumar","year":"2008","unstructured":"Kumar, T.K.S.: A framework for hybrid tractability results in boolean weighted constraint satisfaction problems. In: Stuckey, P.J. (ed.) CP 2008. LNCS, vol. 5202, pp. 282\u2013297. Springer, Heidelberg (2008). \n                    https:\/\/doi.org\/10.1007\/978-3-540-85958-1_19"},{"key":"43_CR29","unstructured":"Kumar, T.K.S.: Lifting techniques for weighted constraint satisfaction problems. In: International Symposium on Artificial Intelligence and Mathematics (2008). \n                    http:\/\/isaim2008.unl.edu\/PAPERS\/TechnicalProgram\/ISAIM2008_0004_d1de5114b3cb94de7e670ab2905c3b3d.pdf"},{"key":"43_CR30","unstructured":"Kumar, T.K.S.: Kernelization, generation of bounds, and the scope of incremental computation for weighted constraint satisfaction problems. In: International Symposium on Artificial Intelligence and Mathematics (2016)"},{"key":"43_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/978-3-642-02777-2_45","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2009","author":"V Manquinho","year":"2009","unstructured":"Manquinho, V., Marques-Silva, J., Planes, J.: Algorithms for weighted Boolean optimization. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol. 5584, pp. 495\u2013508. Springer, Heidelberg (2009). \n                    https:\/\/doi.org\/10.1007\/978-3-642-02777-2_45"},{"key":"43_CR32","unstructured":"Manquinho, V., Roussel, O.: Pseudo-Boolean competition (2016). \n                    http:\/\/www.cril.univ-artois.fr\/PB16"},{"key":"43_CR33","first-page":"209","volume":"2","author":"VM Manquinho","year":"2006","unstructured":"Manquinho, V.M., Marques-Silva, J.: On using cutting planes in Pseudo-Boolean optimization. J. Satisf. Boolean Model. Comput. 2, 209\u2013219 (2006)","journal-title":"J. Satisf. Boolean Model. Comput."},{"key":"43_CR34","unstructured":"Osokin, A.: MATLAB wrapper to the QPBO algorithm by V. Kolmogorov (2014). \n                    https:\/\/github.com\/aosokin\/qpboMex"},{"key":"43_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/978-3-319-24318-4_2","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2015","author":"T Philipp","year":"2015","unstructured":"Philipp, T., Steinke, P.: PBLib \u2013 a library for encoding Pseudo-Boolean constraints into CNF. In: Heule, M., Weaver, S. (eds.) SAT 2015. LNCS, vol. 9340, pp. 9\u201316. Springer, Cham (2015). \n                    https:\/\/doi.org\/10.1007\/978-3-319-24318-4_2"},{"issue":"2","key":"43_CR36","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s10107-008-0235-8","volume":"121","author":"F Rendl","year":"2010","unstructured":"Rendl, F., Rinaldi, G., Wiegele, A.: Solving max-cut to optimality by intersecting semidefinite and polyhedral relaxations. Math. Program. 121(2), 307 (2010)","journal-title":"Math. Program."},{"issue":"3","key":"43_CR37","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1287\/mnsc.17.3.200","volume":"17","author":"J Rhys","year":"1970","unstructured":"Rhys, J.: A selection problem of shared fixed costs and network flows. Manag. Sci. 17(3), 200\u2013207 (1970)","journal-title":"Manag. Sci."},{"issue":"1","key":"43_CR38","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.jda.2004.02.001","volume":"3","author":"I Wegener","year":"2005","unstructured":"Wegener, I., Witt, C.: On the analysis of a simple evolutionary algorithm on quadratic Pseudo-Boolean functions. J. Discrete Algorithms 3(1), 61\u201378 (2005)","journal-title":"J. Discrete Algorithms"},{"key":"43_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1007\/978-3-319-66158-2_40","volume-title":"Principles and Practice of Constraint Programming","author":"H Xu","year":"2017","unstructured":"Xu, H., Koenig, S., Kumar, T.K.S.: A constraint composite graph-based ILP encoding of the Boolean weighted CSP. In: Beck, J.C. (ed.) CP 2017. LNCS, vol. 10416, pp. 630\u2013638. Springer, Cham (2017). \n                    https:\/\/doi.org\/10.1007\/978-3-319-66158-2_40"},{"key":"43_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/978-3-319-59776-8_31","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"H Xu","year":"2017","unstructured":"Xu, H., Satish Kumar, T.K., Koenig, S.: The Nemhauser-Trotter reduction and lifted message passing for the weighted CSP. In: Salvagnin, D., Lombardi, M. (eds.) CPAIOR 2017. LNCS, vol. 10335, pp. 387\u2013402. Springer, Cham (2017). \n                    https:\/\/doi.org\/10.1007\/978-3-319-59776-8_31"}],"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-19212-9_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T19:11:48Z","timestamp":1558984308000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-19212-9_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030192112","9783030192129"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-19212-9_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"28 April 2019","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":"Thessaloniki","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2019b","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cpaior2019.uowm.gr\/","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"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"94","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"34","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"9","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"36% - 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"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"5.67","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}