{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T07:23:07Z","timestamp":1783149787090,"version":"3.54.6"},"publisher-location":"Cham","reference-count":44,"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_7","type":"book-chapter","created":{"date-parts":[[2023,5,22]],"date-time":"2023-05-22T17:03:04Z","timestamp":1684774984000},"page":"96-113","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Local Branching Relaxation Heuristics for\u00a0Integer Linear Programs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8733-2379","authenticated-orcid":false,"given":"Taoan","family":"Huang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7422-0044","authenticated-orcid":false,"given":"Aaron","family":"Ferber","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4202-4847","authenticated-orcid":false,"given":"Yuandong","family":"Tian","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6784-473X","authenticated-orcid":false,"given":"Bistra","family":"Dilkina","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5767-4976","authenticated-orcid":false,"given":"Benoit","family":"Steiner","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,5,23]]},"reference":[{"key":"7_CR1","series-title":"Operations Research Proceedings","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-642-29210-1_12","volume-title":"Operations Research Proceedings 2011","author":"T Achterberg","year":"2012","unstructured":"Achterberg, T., Berthold, T., Hendel, G.: Rounding and propagation heuristics for mixed integer programming. In: Klatte, D., L\u00fcthi, H.J., Schmedders, K. (eds.) Operations Research Proceedings 2011. Operations Research Proceedings, pp. 71\u201376. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29210-1_12"},{"key":"7_CR2","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, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38189-8_18"},{"issue":"1","key":"7_CR3","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","volume":"74","author":"R Albert","year":"2002","unstructured":"Albert, R., Barab\u00e1si, A.L.: Statistical mechanics of complex networks. Rev. Mod. Phys. 74(1), 47 (2002)","journal-title":"Rev. Mod. Phys."},{"issue":"4","key":"7_CR4","doi-asserted-by":"publisher","first-page":"1026","DOI":"10.1287\/opre.1080.0548","volume":"56","author":"AR Amaral","year":"2008","unstructured":"Amaral, A.R.: An exact approach to the one-dimensional facility layout problem. Oper. Res. 56(4), 1026\u20131033 (2008)","journal-title":"Oper. Res."},{"key":"7_CR5","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/j.cor.2013.08.016","volume":"41","author":"N Azi","year":"2014","unstructured":"Azi, N., Gendreau, M., Potvin, J.Y.: An adaptive large neighborhood search for a vehicle routing problem with multiple routes. Comput. Oper. Res. 41, 167\u2013173 (2014)","journal-title":"Comput. Oper. Res."},{"key":"7_CR6","unstructured":"Berthold, T.: Primal heuristics for mixed integer programs. Ph.D. thesis, Zuse Institute Berlin (ZIB) (2006)"},{"issue":"1","key":"7_CR7","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s12532-013-0060-9","volume":"6","author":"T Berthold","year":"2014","unstructured":"Berthold, T.: Rens. Math. Program. Comput. 6(1), 33\u201354 (2014)","journal-title":"Math. Program. Comput."},{"key":"7_CR8","unstructured":"Bestuzheva, K., et al.: The SCIP optimization suite 8.0. Technical report, Optimization Online (2021). http:\/\/www.optimization-online.org\/DB_HTML\/2021\/12\/8728.html"},{"key":"7_CR9","unstructured":"Chen, X., Tian, Y.: Learning to perform local rewriting for combinatorial optimization. Adv. Neural Inf. Process. Syst. 32 (2019)"},{"issue":"1","key":"7_CR10","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s10107-004-0518-7","volume":"102","author":"E Danna","year":"2005","unstructured":"Danna, E., Rothberg, E., Pape, C.L.: Exploring relaxation induced neighborhoods to improve MIP solutions. Math. Program. 102(1), 71\u201390 (2005)","journal-title":"Math. Program."},{"issue":"3","key":"7_CR11","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1287\/ijoc.15.3.284.16077","volume":"15","author":"S De Vries","year":"2003","unstructured":"De Vries, S., Vohra, R.V.: Combinatorial auctions: a survey. INFORMS J. Comput. 15(3), 284\u2013309 (2003)","journal-title":"INFORMS J. Comput."},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-642-13520-0_14","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"B Dilkina","year":"2010","unstructured":"Dilkina, B., Gomes, C.P.: Solving connected subgraph problems in wildlife conservation. In: Lodi, A., Milano, M., Toth, P. (eds.) CPAIOR 2010. LNCS, vol. 6140, pp. 102\u2013116. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13520-0_14"},{"issue":"1","key":"7_CR13","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10107-003-0395-5","volume":"98","author":"M Fischetti","year":"2003","unstructured":"Fischetti, M., Lodi, A.: Local branching. Math. program. 98(1), 23\u201347 (2003)","journal-title":"Math. program."},{"key":"7_CR14","unstructured":"Gasse, M., Ch\u00e9telat, D., Ferroni, N., Charlin, L., Lodi, A.: Exact combinatorial optimization with graph convolutional neural networks. Adv. Neural Inf. Process. Syst. 32 (2019)"},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/978-3-540-72792-7_24","volume-title":"Integer Programming and Combinatorial Optimization","author":"S Ghosh","year":"2007","unstructured":"Ghosh, S.: DINS, a MIP improvement heuristic. In: Fischetti, M., Williamson, D.P. (eds.) IPCO 2007. LNCS, vol. 4513, pp. 310\u2013323. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72792-7_24"},{"issue":"3","key":"7_CR16","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\u00a0mixed-integer programming library. Math. Program. Comput. 13(3), 443\u2013490 (2021). https:\/\/doi.org\/10.1007\/s12532-020-00194-3","journal-title":"Math. Program. Comput."},{"key":"7_CR17","unstructured":"Gurobi Optimization, LLC: Gurobi Optimizer Reference Manual (2022). https:\/\/www.gurobi.com"},{"issue":"2","key":"7_CR18","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/s12532-021-00209-7","volume":"14","author":"G Hendel","year":"2022","unstructured":"Hendel, G.: Adaptive large neighborhood search for mixed integer programming. Math. Program. Comput. 14(2), 185\u2013221 (2022)","journal-title":"Math. Program. Comput."},{"issue":"1","key":"7_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0377-2217(91)90088-D","volume":"53","author":"SS Heragu","year":"1991","unstructured":"Heragu, S.S., Kusiak, A.: Efficient models for the facility layout problem. Eur. J. Oper. Res. 53(1), 1\u201313 (1991)","journal-title":"Eur. J. Oper. Res."},{"key":"7_CR20","unstructured":"Hottung, A., Tierney, K.: Neural large neighborhood search for the capacitated vehicle routing problem. In: ECAI 2020, pp. 443\u2013450. IOS Press (2020)"},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"Huang, T., Dilkina, B.: Enhancing seismic resilience of water pipe networks. In: Proceedings of the 3rd ACM SIGCAS Conference on Computing and Sustainable Societies, pp. 44\u201352 (2020)","DOI":"10.1145\/3378393.3402246"},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"Huang, T., Li, J., Koenig, S., Dilkina, B.: Anytime multi-agent path finding via machine learning-guided large neighborhood search. In: Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), pp. 9368\u20139376 (2022)","DOI":"10.1609\/aaai.v36i9.21168"},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"Huang, T., et al.: Deadline-aware multi-agent tour planning. In: Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS) (2023)","DOI":"10.1609\/icaps.v33i1.27194"},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"Khalil, E., Le Bodic, P., Song, L., Nemhauser, G., Dilkina, B.: Learning to branch in mixed integer programming. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 30 (2016)","DOI":"10.1609\/aaai.v30i1.10080"},{"key":"7_CR25","unstructured":"Kleinberg, J., Tardos, E.: Algorithm Design. Pearson Education India (2006)"},{"issue":"5","key":"7_CR26","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1007\/s10951-011-0246-9","volume":"15","author":"AA Kovacs","year":"2012","unstructured":"Kovacs, A.A., Parragh, S.N., Doerner, K.F., Hartl, R.F.: Adaptive large neighborhood search for service technician routing and scheduling problems. J. Sched. 15(5), 579\u2013600 (2012)","journal-title":"J. Sched."},{"key":"7_CR27","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":"7_CR28","doi-asserted-by":"crossref","unstructured":"Li, J., Chen, Z., Harabor, D., Stuckey, P.J., Koenig, S.: Anytime multi-agent path finding via large neighborhood search. In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), pp. 4127\u20134135 (2021)","DOI":"10.24963\/ijcai.2021\/568"},{"key":"7_CR29","doi-asserted-by":"crossref","unstructured":"Li, J., Chen, Z., Harabor, D., Stuckey, P.J., Koenig, S.: MAPF-LNS2: fast repairing for multi-agent path finding via large neighborhood search. In: Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), pp. 10256\u201310265 (2022)","DOI":"10.1609\/aaai.v36i9.21266"},{"key":"7_CR30","first-page":"26198","volume":"34","author":"S Li","year":"2021","unstructured":"Li, S., Yan, Z., Wu, C.: Learning to delegate for large-scale vehicle routing. Adv. Neural. Inf. Process. Syst. 34, 26198\u201326211 (2021)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"7_CR31","unstructured":"Liu, D., Fischetti, M., Lodi, A.: Revisiting local branching with a machine learning lens"},{"key":"7_CR32","unstructured":"Lu, H., Zhang, X., Yang, S.: A learning-based iterative method for solving vehicle routing problems. In: International Conference on Learning Representations (2019)"},{"key":"7_CR33","unstructured":"Maher, S.J., et al.: The SCIP optimization suite 4.0 (2017)"},{"issue":"2","key":"7_CR34","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1287\/opre.8.2.219","volume":"8","author":"AS Manne","year":"1960","unstructured":"Manne, A.S.: On the job-shop scheduling problem. Oper. Res. 8(2), 219\u2013223 (1960)","journal-title":"Oper. Res."},{"issue":"3\u20134","key":"7_CR35","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0004-3702(70)90007-X","volume":"1","author":"I Pohl","year":"1970","unstructured":"Pohl, I.: Heuristic search viewed as path finding in a graph. Artif. Intell. 1(3\u20134), 193\u2013204 (1970)","journal-title":"Artif. Intell."},{"issue":"4","key":"7_CR36","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1287\/trsc.1050.0135","volume":"40","author":"S Ropke","year":"2006","unstructured":"Ropke, S., Pisinger, D.: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp. Sci. 40(4), 455\u2013472 (2006)","journal-title":"Transp. Sci."},{"issue":"4","key":"7_CR37","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1287\/ijoc.1060.0189","volume":"19","author":"E Rothberg","year":"2007","unstructured":"Rothberg, E.: An evolutionary algorithm for polishing mixed integer programming solutions. INFORMS J. Comput. 19(4), 534\u2013541 (2007)","journal-title":"INFORMS J. Comput."},{"key":"7_CR38","unstructured":"Scavuzzo, L., et al.: Learning to branch with tree MDPS. arXiv preprint arXiv:2205.11107 (2022)"},{"key":"7_CR39","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cor.2017.05.010","volume":"87","author":"SL Smith","year":"2017","unstructured":"Smith, S.L., Imeson, F.: GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem. Comput. Oper. Res. 87, 1\u201319 (2017)","journal-title":"Comput. Oper. Res."},{"key":"7_CR40","first-page":"20012","volume":"33","author":"J Song","year":"2020","unstructured":"Song, J., Yue, Y., Dilkina, B., et al.: A general large neighborhood search framework for solving integer linear programs. Adv. Neural. Inf. Process. Syst. 33, 20012\u201320023 (2020)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"7_CR41","unstructured":"Sonnerat, N., Wang, P., Ktena, I., Bartunov, S., Nair, V.: Learning a large neighborhood search algorithm for mixed integer programs. arXiv preprint arXiv:2107.10201 (2021)"},{"key":"7_CR42","doi-asserted-by":"crossref","unstructured":"Toth, P., Vigo, D.: The Vehicle Routing Problem. SIAM (2002)","DOI":"10.1137\/1.9780898718515"},{"key":"7_CR43","first-page":"30075","volume":"34","author":"Y Wu","year":"2021","unstructured":"Wu, Y., Song, W., Cao, Z., Zhang, J.: Learning large neighborhood search policy for integer programming. Adv. Neural. Inf. Process. Syst. 34, 30075\u201330087 (2021)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"issue":"2","key":"7_CR44","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1016\/j.ejor.2017.06.056","volume":"264","author":"I \u017dulj","year":"2018","unstructured":"\u017dulj, I., Kramer, S., Schneider, M.: A hybrid of adaptive large neighborhood search and tabu search for the order-batching problem. Eur. J. Oper. Res. 264(2), 653\u2013664 (2018)","journal-title":"Eur. J. Oper. Res."}],"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_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,13]],"date-time":"2023-12-13T15:47:38Z","timestamp":1702482458000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-33271-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031332708","9783031332715"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-33271-5_7","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)"}}]}}