{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T03:57:17Z","timestamp":1784260637421,"version":"3.55.0"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031080104","type":"print"},{"value":"9783031080111","type":"electronic"}],"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-08011-1_8","type":"book-chapter","created":{"date-parts":[[2022,6,9]],"date-time":"2022-06-09T16:16:42Z","timestamp":1654791402000},"page":"91-102","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Learning Pseudo-Backdoors for\u00a0Mixed Integer Programs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7422-0044","authenticated-orcid":false,"given":"Aaron","family":"Ferber","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5633-9909","authenticated-orcid":false,"given":"Jialin","family":"Song","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6784-473X","authenticated-orcid":false,"given":"Bistra","family":"Dilkina","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9127-1989","authenticated-orcid":false,"given":"Yisong","family":"Yue","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,6,10]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","unstructured":"Achterberg, T., Wunderling, R.: Mixed integer programming: analyzing 12 years of progress. In: J\u00fcnger, M., Reinelt, G. (eds) Facets of Combinatorial Optimization, pp. 449\u2013481. Springer, Berlin (2013). https:\/\/doi.org\/10.1007\/978-3-642-38189-8_18","DOI":"10.1007\/978-3-642-38189-8_18"},{"key":"8_CR2","unstructured":"Ans\u00f3tegui, C., Malitsky, Y., Samulowitz, H., Sellmann, M., Tierney, K.: Model-based genetic algorithms for algorithm configuration. In: International Conference on Artificial Intelligence, pp. 733\u2013739 (2015)"},{"key":"8_CR3","doi-asserted-by":"publisher","unstructured":"Balas, E., Ho, A.: Set covering algorithms using cutting planes, heuristics, and subgradient optimization: a computational study. In: Padberg, M.W. (eds) Combinatorial Optimization, pp. 37\u201360. Springer, Berlin (1980). https:\/\/doi.org\/10.1007\/BFb0120886","DOI":"10.1007\/BFb0120886"},{"key":"8_CR4","unstructured":"Balcan, M.F., Dick, T., Sandholm, T., Vitercik, E.: Learning to branch. In: International Conference on Machine Learning (ICML) (2018)"},{"key":"8_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-42849-9","volume-title":"Decision Diagrams for Optimization","author":"D Bergman","year":"2016","unstructured":"Bergman, D., Cire, A.A., Hoeve, W.J., Hooker, J.: Decision Diagrams for Optimization, 1st edn. Springer Publishing Company Inc., Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-42849-9","edition":"1"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Burges, C., et al.: Learning to rank using gradient descent. In: Proceedings of the 22nd International Conference on Machine learning, pp. 89\u201396 (2005)","DOI":"10.1145\/1102351.1102363"},{"issue":"1","key":"8_CR7","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.ejor.2016.11.050","volume":"260","author":"M Colombi","year":"2017","unstructured":"Colombi, M., Mansini, R., Savelsbergh, M.: The generalized independent set problem: polyhedral analysis and solution approaches. Eur. J. Oper. Res. 260(1), 41\u201355 (2017)","journal-title":"Eur. J. Oper. Res."},{"key":"8_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-11008-0","volume-title":"Integer Programming","author":"M Conforti","year":"2014","unstructured":"Conforti, M., Cornu\u00e9jols, G., Zambelli, G., et al.: Integer Programming. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11008-0"},{"issue":"3","key":"8_CR9","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1016\/0377-2217(91)90261-S","volume":"50","author":"G Cornu\u00e9jols","year":"1991","unstructured":"Cornu\u00e9jols, G., Sridharan, R., Thizy, J.M.: A comparison of heuristics and relaxations for the capacitated plant location problem. Eur. J. Oper. Res. 50(3), 280\u2013297 (1991)","journal-title":"Eur. J. Oper. Res."},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-642-01929-6_6","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"B Dilkina","year":"2009","unstructured":"Dilkina, B., Gomes, C.P., Malitsky, Y., Sabharwal, A., Sellmann, M.: Backdoors to combinatorial optimization: feasibility and optimality. In: van Hoeve, W.-J., Hooker, J.N. (eds.) CPAIOR 2009. LNCS, vol. 5547, pp. 56\u201370. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01929-6_6"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-642-02777-2_9","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2009","author":"B Dilkina","year":"2009","unstructured":"Dilkina, B., Gomes, C.P., Sabharwal, A.: Backdoors in the context of learning. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol. 5584, pp. 73\u201379. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02777-2_9"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Dvo\u0159\u00e1k, P., Eiben, E., Ganian, R., Knop, D., Ordyniak, S.: Solving integer linear programs with a small number of global variables and constraints. In: International Joint Conference on Artificial Intelligence (IJCAI), pp. 607\u2013613 (2017)","DOI":"10.24963\/ijcai.2017\/85"},{"issue":"1","key":"8_CR13","first-page":"17","volume":"5","author":"P Erd\u0151s","year":"1960","unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci 5(1), 17\u201360 (1960)","journal-title":"Publ. Math. Inst. Hung. Acad. Sci"},{"key":"8_CR14","unstructured":"Fey, M., Lenssen, J.E.: Fast graph representation learning with PyTorch geometric. In: ICLR Workshop on Representation Learning on Graphs and Manifolds (2019)"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-642-20807-2_15","volume-title":"Integer Programming and Combinatoral Optimization","author":"M Fischetti","year":"2011","unstructured":"Fischetti, M., Monaci, M.: Backdoor branching. In: G\u00fcnl\u00fck, O., Woeginger, G.J. (eds.) IPCO 2011. LNCS, vol. 6655, pp. 183\u2013191. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20807-2_15"},{"key":"8_CR16","unstructured":"Gasse, M., Ch\u00e9telat, D., Ferroni, N., Charlin, L., Lodi, A.: Exact combinatorial optimization with graph convolutional neural networks. In: Advances in Neural Information Processing Systems (NeurIPS) (2019)"},{"key":"8_CR17","unstructured":"Gowal, S., et al.: On the effectiveness of interval bound propagation for training verifiably robust models (2018). arXiv preprint http:\/\/arxiv.org\/abs\/1810.12715"},{"key":"8_CR18","unstructured":"Gurobi Optimization, L.: Gurobi optimizer reference manual (2021). www.gurobi.com\/documentation\/9.1\/refman\/branchpriority.html"},{"key":"8_CR19","unstructured":"Gurobi Optimization, L.: Gurobi optimizer reference manual (2021). http:\/\/www.gurobi.com"},{"issue":"4","key":"8_CR20","first-page":"544","volume":"43","author":"DS Hochbaum","year":"1997","unstructured":"Hochbaum, D.S., Pathria, A.: Forest harvesting and minimum cuts: a new approach to handling spatial constraints. For. Sci. 43(4), 544\u2013554 (1997)","journal-title":"For. Sci."},{"key":"8_CR21","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-642-21434-9_3","volume-title":"Auton. Search","author":"HH Hoos","year":"2011","unstructured":"Hoos, H.H.: Automated algorithm configuration and parameter tuning. In: Hamadi, Y., Monfroy, E., Saubion, F. (eds.) Auton. Search, pp. 37\u201371. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21434-9_3"},{"key":"8_CR22","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1613\/jair.2861","volume":"36","author":"F Hutter","year":"2009","unstructured":"Hutter, F., Hoos, H.H., Leyton-Brown, K., St\u00fctzle, T.: Paramils: an automatic algorithm configuration framework. J. Artif. Intell. Res. 36, 267\u2013306 (2009)","journal-title":"J. Artif. Intell. Res."},{"key":"8_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/978-3-540-74970-7_26","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"M J\u00e4rvisalo","year":"2007","unstructured":"J\u00e4rvisalo, M., Junttila, T.: Limitations of restricted branching in clause learning. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 348\u2013363. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74970-7_26"},{"issue":"1\u20133","key":"8_CR24","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.jalgor.2008.02.005","volume":"63","author":"M J\u00e4rvisalo","year":"2008","unstructured":"J\u00e4rvisalo, M., Niemel\u00e4, I.: The effect of structural branching on the efficiency of clause learning sat solving: an experimental study. J. Algorithms 63(1\u20133), 90\u2013113 (2008)","journal-title":"J. Algorithms"},{"key":"8_CR25","doi-asserted-by":"crossref","unstructured":"Khalil, E., Le Bodic, P., Song, L., Nemhauser, G., Dilkina, B.: Learning to branch in mixed integer programming. In: AAAI Conference on Artificial Intelligence (2016)","DOI":"10.1609\/aaai.v30i1.10080"},{"key":"8_CR26","doi-asserted-by":"crossref","unstructured":"Khalil, E.B., Dilkina, B., Nemhauser, G., Ahmed, S., Shao, Y.: Learning to run heuristics in tree search. In: International Joint Conference on Artificial Intelligence (IJCAI) (2017)","DOI":"10.24963\/ijcai.2017\/92"},{"key":"8_CR27","doi-asserted-by":"crossref","unstructured":"Khalil, E.B., Vaezipoor, P., Dilkina, B.: Finding backdoors to integer programs: a monte carlo tree search framework (2022)","DOI":"10.1609\/aaai.v36i4.20293"},{"key":"8_CR28","unstructured":"Kilby, P., Slaney, J., Thi\u00e9baux, S., Walsh, T.: Backbones and backdoors in satisfiability. In: AAAI, pp. 1368\u20131373 (2005)"},{"issue":"2","key":"8_CR29","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s12532-011-0025-9","volume":"3","author":"T Koch","year":"2011","unstructured":"Koch, T., et al.: Miplib 2010. Math. Program. Comput. 3(2), 103\u2013163 (2011). https:\/\/doi.org\/10.1007\/s12532-011-0025-9","journal-title":"Math. Program. Comput."},{"key":"8_CR30","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-540-68279-0_5","volume-title":"50 Years of Integer Programming 1958-2008","author":"AH Land","year":"2010","unstructured":"Land, A.H., Doig, A.G.: An automatic method for solving discrete programming problems. In: J\u00fcnger, M. (ed.) 50 Years of Integer Programming 1958-2008, pp. 105\u2013132. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-540-68279-0_5"},{"key":"8_CR31","doi-asserted-by":"crossref","unstructured":"Leyton-Brown, K., Pearson, M., Shoham, Y.: Towards a universal test suite for combinatorial auction algorithms. In: ACM Conference on Electronic Commerce, pp. 66\u201376 (2000)","DOI":"10.1145\/352871.352879"},{"key":"8_CR32","unstructured":"Li, Y., Zemel, R., Brockschmidt, M., Tarlow, D.: Gated graph sequence neural networks. In: ICLR (2016)"},{"issue":"3","key":"8_CR33","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1561\/1500000016","volume":"3","author":"TY Liu","year":"2009","unstructured":"Liu, T.Y., et al.: Learning to rank for information retrieval. Found. Trends\u00ae Inf. Retrieval 3(3), 225\u2013331 (2009)","journal-title":"Found. Trends\u00ae Inf. Retrieval"},{"key":"8_CR34","unstructured":"Nair, V. et al.: Solving mixed integer programs using neural networks (2020)"},{"key":"8_CR35","unstructured":"Paszke, A., et al.: An imperative style, high-performance deep learning library. In: Wallach, H., Larochelle, H., Beygelzimer, A., d\u2019 Alch\u00e9-Buc, F., Fox, E., Garnett, R. (eds.) Advances in Neural Information Processing Systems 32, pp. 8024\u20138035. Curran Associates, Inc. (2019). http:\/\/papers.neurips.cc\/paper\/9015-pytorch-an-imperative-style-high-performance-deep-learning-library.pdf"},{"key":"8_CR36","doi-asserted-by":"crossref","unstructured":"Semenov, A., Zaikin, O., Otpuschennikov, I., Kochemazov, S., Ignatiev, A.: On cryptographic attacks using backdoors for SAT. In: AAAI Conference on Artificial Intelligence (2018)","DOI":"10.1609\/aaai.v32i1.12205"},{"key":"8_CR37","unstructured":"Tsochantaridis, I., Joachims, T., Hofmann, T., Altun, Y., Singer, Y.: Large margin methods for structured and interdependent output variables. J. Mach. Learn. Res. 6(9) (2005)"},{"key":"8_CR38","unstructured":"Vaswani, A., et al.: Attention is all you need. Advances in neural information processing systems, vol. 30 (2017)"},{"key":"8_CR39","unstructured":"Veli\u010dkovi\u0107, P., Cucurull, G., Casanova, A., Romero, A., Li\u00f2, P., Bengio, Y.: Graph attention networks. In: International Conference on Learning Representations (ICLR) (2018). https:\/\/openreview.net\/forum?id=rJXMpikCZ, accepted as poster"},{"key":"8_CR40","unstructured":"Williams, R., Gomes, C.P., Selman, B.: Backdoors to typical case complexity. In: International Joint Conference on Artificial Intelligence (IJCAI), vol. 3, pp. 1173\u20131178 (2003)"}],"container-title":["Lecture Notes in Computer Science","Integration of Constraint Programming, Artificial Intelligence, and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-08011-1_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,7]],"date-time":"2023-02-07T20:36:54Z","timestamp":1675802214000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-08011-1_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031080104","9783031080111"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-08011-1_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"10 June 2022","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":"Los Angeles, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"20 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/usc.edu\/cpaior-2022\/","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":"60","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":"28","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":"0","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":"47% - 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","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":"4","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)"}}]}}