{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T18:19:55Z","timestamp":1743013195012,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031812408"},{"type":"electronic","value":"9783031812415"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-81241-5_25","type":"book-chapter","created":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T13:45:39Z","timestamp":1735652739000},"page":"320-327","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Machine Learning Techniques for\u00a0Branch-and-Cut Methods: The\u00a0Selection of\u00a0Cutting Planes"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3714-197X","authenticated-orcid":false,"given":"Giovanni","family":"Giallombardo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6304-5877","authenticated-orcid":false,"given":"Giovanna","family":"Miglionico","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8964-9281","authenticated-orcid":false,"given":"Marcello","family":"Sammarra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,1,1]]},"reference":[{"key":"25_CR1","unstructured":"Berthold, T., Francobaldi, M., Hendel, G.: Learning to use local cuts: arXiv:2206.11618v1 (2022)"},{"key":"25_CR2","first-page":"1871","volume":"9","author":"R-E Fan","year":"2008","unstructured":"Fan, R.-E., Chang, K.-W., Hsieh, C.-J., Wang, X.-R., Lin, C.-J.: LIBLINEAR: a library for large linear classification. J. Mach. Learn. Res. 9, 1871\u20131874 (2008)","journal-title":"J. Mach. Learn. Res."},{"key":"25_CR3","doi-asserted-by":"publisher","first-page":"108353","DOI":"10.1016\/j.patcog.2021.108353","volume":"123","author":"Z Huang","year":"2022","unstructured":"Huang, Z., et al.: Learning to select cuts for efficient mixed-integer programming. Pattern Recogn. 123, 108353 (2022)","journal-title":"Pattern Recogn."},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1090\/S0002-9904-1958-10224-4","volume":"64","author":"R Gomory","year":"1958","unstructured":"Gomory, R.: Outline of an algorithm for integer solutions to linear programs. Bull. Am. Math. Soc. 64, 275\u2013278 (1958)","journal-title":"Bull. Am. Math. Soc."},{"issue":"2","key":"25_CR5","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s11750-017-0451-6","volume":"25","author":"A Lodi","year":"2017","unstructured":"Lodi, A., Zarpellon, G.: On learning and branching: a survey. TOP 25(2), 207\u2013236 (2017). https:\/\/doi.org\/10.1007\/s11750-017-0451-6","journal-title":"TOP"},{"key":"25_CR6","unstructured":"Paulus, MB., Zarpellon, G., Krause, A., Charlin, L., Maddison CJ.: Learning to cut by looking ahead: cutting plane selection via imitation learning. In: Proceedings of the $$39$$th International Conference on Machine Learning, Baltimore, Maryland, USA, PMLR, 162, arXiv:2206.13414v1 (2022)"},{"key":"25_CR7","volume-title":"Learning with Kernels","author":"B Sch\u00f6lkopf","year":"2002","unstructured":"Sch\u00f6lkopf, B., Smola, A.J.: Learning with Kernels. The MIT press, Cambridge, Massachusetts (2002)"},{"key":"25_CR8","unstructured":"Tang, Y., Agrawal, S., Faenza, Y.: Reinforcement learning for integer programming: learning to cut. In: Proceedings of the 37th International Conference on Machine Learning, Article 868, pp. 9367\u20139376 (2020). arXiv:1906.04859"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Turner M., Koch T., Serrano F., Winkler M.: Adaptive cut selection in mixed-integer linear programming. Open J. Mathe. Optim. 4 Article 5 (2023)","DOI":"10.5802\/ojmo.25"},{"key":"25_CR10","volume-title":"Integer Programming","author":"LA Wolsey","year":"1998","unstructured":"Wolsey, L.A.: Integer Programming. Wiley-Interscience, New York (1998)"},{"key":"25_CR11","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/j.neucom.2022.11.024","volume":"519","author":"J Zhang","year":"2023","unstructured":"Zhang, J., Liu, C., Li, X., Zhen, H.L., Yuan, M., Li, Y.: A survey for solving mixed integer programming via machine learning. Neurocomputing 519, 205\u2013217 (2023)","journal-title":"Neurocomputing"}],"container-title":["Lecture Notes in Computer Science","Numerical Computations: Theory and Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-81241-5_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T14:04:35Z","timestamp":1735653875000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-81241-5_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031812408","9783031812415"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-81241-5_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"1 January 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NUMTA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Numerical Computations: Theory and Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pizzo Calabro","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"14 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"numta2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.numta.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}