{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T11:44:56Z","timestamp":1778154296668,"version":"3.51.4"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031821554","type":"print"},{"value":"9783031821561","type":"electronic"}],"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-82156-1_17","type":"book-chapter","created":{"date-parts":[[2025,3,4]],"date-time":"2025-03-04T08:48:53Z","timestamp":1741078133000},"page":"214-226","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Learning Different Separations in\u00a0Branch and\u00a0Cut: A Survey"],"prefix":"10.1007","author":[{"given":"Chaima","family":"Ayachi Amar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Khadra","family":"Bouanane","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oussama","family":"Aiadi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,3,5]]},"reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/s10626-012-0141-3","volume":"23","author":"W Tao","year":"2013","unstructured":"Tao, W., Akartunal\u0131, K., Song, J., Shi, L.: Mixed integer programming in production planning with backlogging and setup carryover: modeling and algorithms. Dis. Event Dyn. Syst. 23, 211\u2013239 (2013)","journal-title":"Dis. Event Dyn. Syst."},{"issue":"1","key":"17_CR2","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1016\/j.cie.2008.06.008","volume":"56","author":"AB Keha","year":"2009","unstructured":"Keha, A.B., Khowala, K., Fowler, J.W.: Mixed integer programming formulations for single machine scheduling problems. Comput. Indust. Eng. 56(1), 357\u2013367 (2009)","journal-title":"Comput. Indust. Eng."},{"key":"17_CR3","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., Liebling, T.M., Naddef, D., Nemhauser, G.L., Pulleyblank, W.R., Reinelt, G., Rinaldi, G., Wolsey, L.A. (eds.) 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":"17_CR4","unstructured":"Gomory, R., Rand Corp Santa\u00a0Monica, C.A.: An Algorithm for the Mixed Integer Problem: Notes Linear Programming and Extensions-Part 54. Rand (1960)"},{"key":"17_CR5","unstructured":"Tang, Y., Agrawal, S., Faenza, Y.: Reinforcement learning for integer programming: learning to cut. CoRR, abs\/ arXiv: 1906.04859 (2019)"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Huang, Z., et al.: Learning to select cuts for efficient mixed-integer programming (2021)","DOI":"10.1016\/j.patcog.2021.108353"},{"key":"17_CR7","unstructured":"Paulus, M.B., Zarpellon, G., Krause, A., Charlin, L., Chris, J.: Cutting plane selection via imitation learning, Maddison. Learning to cut by looking ahead (2022)"},{"key":"17_CR8","unstructured":"Berthold, T., Francobaldi, M., Hendel, G.: Learning to use local cuts. arXiv preprint arXiv:2206.11618 (2022)"},{"key":"17_CR9","unstructured":"Wang, Z., et al.: Learning cut selection for mixed-integer linear programming via hierarchical sequence model (2023)"},{"key":"17_CR10","unstructured":"Li, S., Ouyang, W., Paulus, M.B., Wu, C.: Learning to configure separators in branch-and-cut. In: Thirty-seventh Conference on Neural Information Processing Systems (2023)"},{"key":"17_CR11","unstructured":"Bengio, Y., Lodi, A., Prouvost, A.: Machine learning for combinatorial optimization: a methodological tour d\u2019horizon. CoRR, abs\/ arXiv: 1811.06128 (2018)"},{"key":"17_CR12","unstructured":"Huang, L., et al.: Branch and bound in mixed integer linear programming problems: A survey of techniques and trends (2021)"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Zhang, J., Liu, C., Yan, J., Li, X., Zhen, H.-L., Yuan, M.: A survey for solving mixed integer programming via machine learning (2022)","DOI":"10.1016\/j.neucom.2022.11.024"},{"key":"17_CR14","unstructured":"Wesselmann, F., Stuhl, U.: Implementing cutting plane management and selection techniques. Technical Report. University of Paderborn (2012)"},{"issue":"9","key":"17_CR15","doi-asserted-by":"publisher","first-page":"1229","DOI":"10.1287\/mnsc.42.9.1229","volume":"42","author":"E Balas","year":"1996","unstructured":"Balas, E., Ceria, S., Cornu\u00e9jols, G.: Mixed 0\u20131 programming by lift-and-project in a branch-and-cut framework. Manage. Sci. 42(9), 1229\u20131246 (1996)","journal-title":"Manage. Sci."},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"Achterberg, T.: Constraint integer programming (2007)","DOI":"10.1007\/978-3-540-72397-4_3"},{"key":"17_CR17","unstructured":"Gamrath, B., et\u00a0al.: The scip optimization suite 7.0 (2020)"},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"Gleixner, A., et al.: MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library. Math. Program. Comput. (2021)","DOI":"10.1007\/s12532-020-00194-3"},{"issue":"1","key":"17_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S026988890999035X","volume":"25","author":"J Foulds","year":"2010","unstructured":"Foulds, J., Frank, E.: A review of multi-instance learning assumptions. Knowl. Eng. Rev. 25(1), 1\u201325 (2010)","journal-title":"Knowl. Eng. Rev."},{"key":"17_CR20","unstructured":"Applegate, D.L.: The traveling salesman problem: a computational study, vol. 17. Princeton University Press (2006)"},{"key":"17_CR21","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, vol. 32 (2019)"},{"issue":"8","key":"17_CR22","doi-asserted-by":"publisher","first-page":"1735","DOI":"10.1162\/neco.1997.9.8.1735","volume":"9","author":"S Hochreiter","year":"1997","unstructured":"Hochreiter, S., Schmidhuber, J.: Long short-term memory. Neural Comput. 9(8), 1735\u20131780 (1997)","journal-title":"Neural Comput."},{"key":"17_CR23","unstructured":"Baltean-Lugojan, R., Bonami, P., Misener, R., Tramontani, A.: Scoring positive semidefinite cutting planes for quadratic optimization via trained neural networks (2019)"}],"container-title":["Communications in Computer and Information Science","Intelligent Systems and Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-82156-1_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,4]],"date-time":"2025-03-04T08:49:04Z","timestamp":1741078144000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-82156-1_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031821554","9783031821561"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-82156-1_17","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"value":"1865-0929","type":"print"},{"value":"1865-0937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"5 March 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISPR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Systems and Pattern Recognition","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Istanbul","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"T\u00fcrkiye","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 June 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 June 2024","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":"ispr22024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ispr2024.sciencesconf.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}