{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T16:18:26Z","timestamp":1781194706579,"version":"3.54.1"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031539688","type":"print"},{"value":"9783031539695","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-53969-5_3","type":"book-chapter","created":{"date-parts":[[2024,2,15]],"date-time":"2024-02-15T09:03:35Z","timestamp":1707987815000},"page":"24-38","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Speeding Up\u00a0Logic-Based Benders Decomposition by\u00a0Strengthening Cuts with\u00a0Graph Neural Networks"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1413-7115","authenticated-orcid":false,"given":"Johannes","family":"Varga","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9498-1924","authenticated-orcid":false,"given":"Emil","family":"Karlsson","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3293-177X","authenticated-orcid":false,"given":"G\u00fcnther R.","family":"Raidl","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2081-2888","authenticated-orcid":false,"given":"Elina","family":"R\u00f6nnberg","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3749-5820","authenticated-orcid":false,"given":"Fredrik","family":"Lindsten","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6256-0060","authenticated-orcid":false,"given":"Tobias","family":"Rodemann","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,2,16]]},"reference":[{"issue":"1","key":"3_CR1","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1287\/ijoc.2016.0723","volume":"29","author":"AM Alvarez","year":"2017","unstructured":"Alvarez, A.M., Louveaux, Q., Wehenkel, L.: A machine learning-based approximation of strong branching. INFORMS J. Comput. 29(1), 185\u2013195 (2017)","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"3_CR2","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/j.ejor.2020.07.063","volume":"290","author":"Y Bengio","year":"2021","unstructured":"Bengio, Y., Lodi, A., Prouvost, A.: Machine learning for combinatorial optimization: a methodological tour d\u2019Horizon. Eur. J. Oper. Res. 290(2), 405\u2013421 (2021)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"3_CR3","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1287\/ijoc.3.2.157","volume":"3","author":"JW Chinneck","year":"1991","unstructured":"Chinneck, J.W., Dravnieks, E.W.: Locating minimal infeasible constraint sets in linear programs. ORSA J. Comput. 3(2), 157\u2013168 (1991)","journal-title":"ORSA J. Comput."},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s10479-011-1031-z","volume":"210","author":"E Coban","year":"2013","unstructured":"Coban, E., Hooker, J.N.: Single-facility scheduling by logic-based Benders decomposition. Ann. Oper. Res. 210, 245\u2013272 (2013)","journal-title":"Ann. Oper. Res."},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Friess, S., Ti\u0148o, P., Xu, Z., Menzel, S., Sendhoff, B., Yao, X.: Artificial neural networks as feature extractors in continuous evolutionary optimization. In: 2021 International Joint Conference on Neural Networks, pp. 1\u20139 (2021)","DOI":"10.1109\/IJCNN52387.2021.9533915"},{"key":"3_CR6","unstructured":"Gr\u00e4ning, L., Jin, Y., Sendhoff, B.: Efficient evolutionary optimization using individual-based evolution control and neural networks: a comparative study. In: ESANN, pp. 273\u2013278 (2005)"},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s10107-003-0375-9","volume":"96","author":"JN Hooker","year":"2003","unstructured":"Hooker, J.N., Ottosson, G.: Logic-based Benders decomposition. Math. Program. 96, 33\u201360 (2003)","journal-title":"Math. Program."},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/s10479-020-03550-7","volume":"307","author":"M Horn","year":"2021","unstructured":"Horn, M., Raidl, G.R., R\u00f6nnberg, E.: A* search for prize-collecting job sequencing with one common and multiple secondary resources. Ann. Oper. Res. 307, 477\u2013505 (2021)","journal-title":"Ann. Oper. Res."},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-030-78230-6_3","volume-title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","author":"E Karlsson","year":"2021","unstructured":"Karlsson, E., R\u00f6nnberg, E.: Strengthening of feasibility cuts in logic-based Benders decomposition. In: Stuckey, P.J. (ed.) Integration of Constraint Programming, Artificial Intelligence, and Operations Research, pp. 45\u201361. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-78230-6_3"},{"key":"3_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2022.105916","volume":"146","author":"E Karlsson","year":"2022","unstructured":"Karlsson, E., R\u00f6nnberg, E.: Logic-based Benders decomposition with a partial assignment acceleration technique for avionics scheduling. Comput. Oper. Res. 146, 105916 (2022)","journal-title":"Comput. Oper. Res."},{"key":"3_CR11","unstructured":"Kool, W., van Hoof, H., Welling, M.: Attention, learn to solve routing problems! In: International Conference on Learning Representations (2019)"},{"issue":"3","key":"3_CR12","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/s43069-020-00023-2","volume":"1","author":"E Lam","year":"2020","unstructured":"Lam, E., Gange, G., Stuckey, P.J., Van Hentenryck, P., Dekker, J.J.: Nutmeg: a MIP and CP hybrid solver using branch-and-check. SN Oper. Res. Forum 1(3), 22 (2020)","journal-title":"SN Oper. Res. Forum"},{"key":"3_CR13","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/978-3-642-38171-3_11","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"MH Liffiton","year":"2013","unstructured":"Liffiton, M.H., Malik, A.: Enumerating infeasibility: finding multiple MUSes quickly. In: Gomes, C., Sellmann, M. (eds.) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. LNCS, vol. 7874, pp. 160\u2013175. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38171-3_11"},{"key":"3_CR14","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: Proceedings of the 39th International Conference on Machine Learning, pp. 17584\u201317600. PMLR (2022)"},{"key":"3_CR15","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.cor.2018.03.008","volume":"96","author":"M Riedler","year":"2018","unstructured":"Riedler, M., Raidl, G.R.: Solving a selective dial-a-ride problem with logic-based benders decomposition. Comput. Oper. Res. 96, 30\u201354 (2018)","journal-title":"Comput. Oper. Res."},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/s43069-023-00242-3","volume":"4","author":"A Saken","year":"2023","unstructured":"Saken, A., Karlsson, E., Maher, S.J., R\u00f6nnberg, E.: Computational evaluation of cut-strengthening techniques in logic-based benders\u2019 decomposition. Oper. Res. Forum 4, 62 (2023)","journal-title":"Oper. Res. Forum"},{"key":"3_CR17","doi-asserted-by":"publisher","first-page":"105786","DOI":"10.1109\/ACCESS.2022.3210168","volume":"10","author":"J Varga","year":"2022","unstructured":"Varga, J., Raidl, G.R., Limmer, S.: Computational methods for scheduling the charging and assignment of an on-site shared electric vehicle fleet. IEEE Access 10, 105786\u2013105806 (2022)","journal-title":"IEEE Access"},{"key":"3_CR18","unstructured":"Vaswani, A., et al.: Attention is all you need. In: Advances in Neural Information Processing Systems, vol. 30. Curran Associates, Inc. (2017)"}],"container-title":["Lecture Notes in Computer Science","Machine Learning, Optimization, and Data Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-53969-5_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,15]],"date-time":"2024-02-15T09:04:17Z","timestamp":1707987857000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-53969-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031539688","9783031539695"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-53969-5_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"16 February 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LOD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Machine Learning, Optimization, and Data Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Grasmere","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","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":"22 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mod2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lod2023.icas.cc\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"In-house system and EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"119","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":"72","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":"61% - 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":"5-6","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":"1-2","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)"}}]}}