{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T04:18:30Z","timestamp":1780633110207,"version":"3.54.1"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031332708","type":"print"},{"value":"9783031332715","type":"electronic"}],"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-33271-5_4","type":"book-chapter","created":{"date-parts":[[2023,5,22]],"date-time":"2023-05-22T17:03:04Z","timestamp":1684774984000},"page":"52-68","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Cutting Plane Selection with\u00a0Analytic Centers and\u00a0Multiregression"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7270-1496","authenticated-orcid":false,"given":"Mark","family":"Turner","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6320-8154","authenticated-orcid":false,"given":"Timo","family":"Berthold","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6284-3033","authenticated-orcid":false,"given":"Mathieu","family":"Besan\u00e7on","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1967-0077","authenticated-orcid":false,"given":"Thorsten","family":"Koch","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,5,23]]},"reference":[{"key":"4_CR1","unstructured":"Achterberg, T.: Constraint integer programming. Ph.D. thesis, TU Berlin (2007)"},{"key":"4_CR2","unstructured":"Achterberg, T.: LP relaxation modification and cut selection in a MIP solver. US Patent US8463729B2 (2013). https:\/\/patents.google.com\/patent\/US8463729B2\/en"},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/978-3-642-38189-8_18","volume-title":"Facets of Combinatorial Optimization","author":"T Achterberg","year":"2013","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, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-642-38189-8_18"},{"issue":"2","key":"4_CR4","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1287\/ijoc.1050.0162","volume":"19","author":"G Andreello","year":"2007","unstructured":"Andreello, G., Caprara, A., Fischetti, M.: Embedding $$\\{$$0, $$1\/2\\}$$-cuts in a branch-and-cut framework: a computational study. Informs J. Comput. 19(2), 229\u2013238 (2007)","journal-title":"Informs J. Comput."},{"key":"4_CR5","doi-asserted-by":"publisher","unstructured":"Baena, D., Castro, J.: Using the analytic center in the feasibility pump. Oper. Res. Lett. 39(5), 310\u2013317 (2011). https:\/\/doi.org\/10.1016\/j.orl.2011.07.005. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0167637711000824","DOI":"10.1016\/j.orl.2011.07.005"},{"key":"4_CR6","unstructured":"Balcan, M.F.F., Prasad, S., Sandholm, T., Vitercik, E.: Sample complexity of tree search configuration: cutting planes and beyond. In: Advances in Neural Information Processing Systems, vol. 34 (2021)"},{"key":"4_CR7","unstructured":"Baltean-Lugojan, R., Bonami, P., Misener, R., Tramontani, A.: Scoring positive semidefinite cutting planes for quadratic optimization via trained neural networks. Optimization-online preprint 2018\/11\/6943 (2019)"},{"key":"4_CR8","series-title":"Operations Research Proceedings","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-319-89920-6_22","volume-title":"Operations Research Proceedings 2017","author":"T Berthold","year":"2018","unstructured":"Berthold, T., Perregaard, M., M\u00e9sz\u00e1ros, C.: Four good reasons to use an interior point solver within a MIP solver. In: Kliewer, N., Ehmke, J.F., Bornd\u00f6rfer, R. (eds.) Operations Research Proceedings 2017. ORP, pp. 159\u2013164. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89920-6_22"},{"key":"4_CR9","unstructured":"Bestuzheva, K., et al.: The SCIP Optimization Suite 8.0 (2021)"},{"key":"4_CR10","unstructured":"FICO Xpress Optimization. https:\/\/www.fico.com\/en\/products\/fico-xpress-optimization. Accessed 10 Nov 2022"},{"issue":"1","key":"4_CR11","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s12532-015-0096-0","volume":"8","author":"M Fischetti","year":"2016","unstructured":"Fischetti, M., Lodi, A., Monaci, M., Salvagnin, D., Tramontani, A.: Improving branch-and-cut performance by random sampling. Math. Program. Comput. 8(1), 113\u2013132 (2016)","journal-title":"Math. Program. Comput."},{"key":"4_CR12","unstructured":"Fischetti, M., Salvagnin, D.: Yoyo search: a bisection cutting-plane method (2009)"},{"issue":"3\u20134","key":"4_CR13","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/s13675-020-00130-z","volume":"8","author":"G Gamrath","year":"2020","unstructured":"Gamrath, G., Berthold, T., Salvagnin, D.: An exploratory computational analysis of dual degeneracy in mixed-integer programming. EURO J. Comput. Optim. 8(3\u20134), 241\u2013261 (2020)","journal-title":"EURO J. Comput. Optim."},{"key":"4_CR14","unstructured":"Gleixner, A., et al.: The SCIP Optimization Suite 6.0. Technical report. 18\u201326, ZIB, Takustr. 7, 14195 Berlin (2018)"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Gleixner, A., et al.: MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library. Math. Program. Comput. 1\u201348 (2021)","DOI":"10.1007\/s12532-020-00194-3"},{"key":"4_CR16","unstructured":"Hofmann, H., Kafadar, K., Wickham, H.: Letter-value plots: boxplots for large data. Technical report, had.co.nz (2011)"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Huang, Z., et al.: Learning to select cuts for efficient mixed-integer programming. arXiv preprint arXiv:2105.13645 (2021)","DOI":"10.1016\/j.patcog.2021.108353"},{"key":"4_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-3-642-21311-3_13","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"A Lodi","year":"2011","unstructured":"Lodi, A., Pesant, G., Rousseau, L.-M.: On counting lattice points and Chv\u00e1tal-Gomory cutting planes. In: Achterberg, T., Beck, J.C. (eds.) CPAIOR 2011. LNCS, vol. 6697, pp. 131\u2013136. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21311-3_13"},{"key":"4_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/978-3-319-42432-3_37","volume-title":"Mathematical Software \u2013 ICMS 2016","author":"S Maher","year":"2016","unstructured":"Maher, S., Miltenberger, M., Pedroso, J.P., Rehfeldt, D., Schwarz, R., Serrano, F.: PySCIPOpt: mathematical programming in Python with the SCIP optimization suite. In: Greuel, G.-M., Koch, T., Paule, P., Sommese, A. (eds.) ICMS 2016. LNCS, vol. 9725, pp. 301\u2013307. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-42432-3_37"},{"key":"4_CR20","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.cor.2013.09.008","volume":"43","author":"J Naoum-Sawaya","year":"2014","unstructured":"Naoum-Sawaya, J.: Recursive central rounding for mixed integer programs. Comput. Oper. Res. 43, 191\u2013200 (2014)","journal-title":"Comput. Oper. Res."},{"key":"4_CR21","unstructured":"Paulus, M.B., Zarpellon, G., Krause, A., Charlin, L., Maddison, C.: Learning to cut by looking ahead: cutting plane selection via imitation learning. In: International Conference on Machine Learning, pp. 17584\u201317600. PMLR (2022)"},{"key":"4_CR22","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa, F., et al.: Scikit-learn: machine learning in Python. J. Mach. Learn. Res. 12, 2825\u20132830 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"4_CR23","unstructured":"Poirrier, L., Yu, J.: On the depth of cutting planes. arXiv preprint arXiv:1903.05304 (2019)"},{"issue":"3","key":"4_CR24","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1023\/B:STCO.0000035301.49549.88","volume":"14","author":"AJ Smola","year":"2004","unstructured":"Smola, A.J., Sch\u00f6lkopf, B.: A tutorial on support vector regression. Stat. Comput. 14(3), 199\u2013222 (2004)","journal-title":"Stat. Comput."},{"key":"4_CR25","unstructured":"Tang, Y., Agrawal, S., Faenza, Y.: Reinforcement learning for integer programming: learning to cut. In: International Conference on Machine Learning, pp. 9367\u20139376. PMLR (2020)"},{"key":"4_CR26","doi-asserted-by":"crossref","unstructured":"Turner, M., Koch, T., Serrano, F., Winkler, M.: Adaptive cut selection in mixed-integer linear programming. arXiv preprint arXiv:2202.10962 (2022)","DOI":"10.5802\/ojmo.25"},{"key":"4_CR27","unstructured":"Wesselmann, F., Stuhl, U.: Implementing cutting plane management and selection techniques. Technical report, University of Paderborn (2012)"},{"key":"4_CR28","doi-asserted-by":"publisher","DOI":"10.1002\/9781119606475","volume-title":"Integer Programming","author":"LA Wolsey","year":"2020","unstructured":"Wolsey, L.A.: Integer Programming. Wiley, Hoboken (2020)"},{"key":"4_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/978-3-540-68891-4_29","volume-title":"Integer Programming and Combinatorial Optimization","author":"A Zanette","year":"2008","unstructured":"Zanette, A., Fischetti, M., Balas, E.: Can pure cutting plane algorithms work? In: Lodi, A., Panconesi, A., Rinaldi, G. (eds.) IPCO 2008. LNCS, vol. 5035, pp. 416\u2013434. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-68891-4_29"}],"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-33271-5_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,13]],"date-time":"2023-12-13T15:47:28Z","timestamp":1702482448000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-33271-5_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031332708","9783031332715"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-33271-5_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"23 May 2023","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":"Nice","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","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":"29 May 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/view\/cpaior2023","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":"71","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":"26","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":"6","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":"37% - 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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}