{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T01:59:15Z","timestamp":1774663155637,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":15,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819698936","type":"print"},{"value":"9789819698943","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-981-96-9894-3_22","type":"book-chapter","created":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T19:56:33Z","timestamp":1753473393000},"page":"256-267","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Improved Cutting Plane Algorithm Combining Generation and Selection Decision Process"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2256-1998","authenticated-orcid":false,"given":"Hongjun","family":"Heng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-9900-576X","authenticated-orcid":false,"given":"Zheng","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,7,26]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"Conforti, M., Cornu\u00e9jols, G., Zambelli, G.: Integer Programming Models. Springer (2014)","DOI":"10.1007\/978-3-319-11008-0"},{"key":"22_CR2","unstructured":"Bolusani, S., et al.: The SCIP Optimization Suite 9.0. arXiv Preprint arXiv:2402.17702 (2024)"},{"key":"22_CR3","unstructured":"Land, A.H., Doig, A.G.: An Automatic Method for Solving Discrete Programming Problems. Springer (2010)"},{"issue":"4","key":"22_CR4","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1137\/0108053","volume":"8","author":"JE Kelley Jr","year":"1960","unstructured":"Kelley, J.E., Jr.: The cutting-plane method for solving convex programs. J. Soc. Ind. Appl. Math. 8(4), 703\u2013712 (1960)","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"22_CR5","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":"22_CR6","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)"},{"key":"22_CR7","unstructured":"Chen, Z., Liu, J., Wang, X., Lu, J., Yin, W.: On representing linear programs by graph neural networks. arXiv Preprint arXiv:2209.12288 (2022)"},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"Li, S., Ouyang, W., Paulus, M., Wu, C.: Learning to configure separators in branch-and-cut. In: Advances in Neural Information Processing Systems, vol. 36 (2024)","DOI":"10.52202\/075280-2622"},{"key":"22_CR9","unstructured":"Wang, Z., et al.: Learning cut selection for mixed-integer linear programming via hierarchical sequence model. arXiv Preprint arXiv:2302.00244 (2023)"},{"key":"22_CR10","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":"22_CR11","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":"22_CR12","unstructured":"Prouvost, A., Dumouchelle, J., Scavuzzo, L., Gasse, M., Ch\u00e9telat, D., Lodi, A.: Ecole: a gym-like library for machine learning in combinatorial optimization solvers. arXiv Preprint arXiv:2011.06069 (2020)"},{"issue":"3","key":"22_CR13","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s12532-020-00194-3","volume":"13","author":"A Gleixner","year":"2021","unstructured":"Gleixner, A., et al.: MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library. Math. Program. Comput. 13(3), 443\u2013490 (2021)","journal-title":"Math. Program. Comput."},{"key":"22_CR14","unstructured":"Nair, V., et al.: Solving mixed integer programs using neural networks. arXiv Preprint arXiv:2012.13349 (2020)"},{"key":"22_CR15","first-page":"32000","volume":"35","author":"AG Labassi","year":"2022","unstructured":"Labassi, A.G., Ch\u00e9telat, D., Lodi, A.: Learning to compare nodes in branch and bound with graph neural networks. Adv. Neural. Inf. Process. Syst. 35, 32000\u201332010 (2022)","journal-title":"Adv. Neural. Inf. Process. Syst."}],"container-title":["Lecture Notes in Computer Science","Advanced Intelligent Computing Technology and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-9894-3_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T01:36:01Z","timestamp":1774661761000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-9894-3_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819698936","9789819698943"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-9894-3_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"26 July 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"ICIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ningbo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 July 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icic2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ic-icc.cn\/icg\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}