{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T19:39:33Z","timestamp":1743017973961,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031605963"},{"type":"electronic","value":"9783031605970"}],"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-60597-0_17","type":"book-chapter","created":{"date-parts":[[2024,5,27]],"date-time":"2024-05-27T14:04:39Z","timestamp":1716818679000},"page":"259-276","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["ULD Build-Up Scheduling with\u00a0Logic-Based Benders Decomposition"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5112-4191","authenticated-orcid":false,"given":"Ricardo","family":"Euler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7223-9174","authenticated-orcid":false,"given":"Ralf","family":"Bornd\u00f6rfer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2668-088X","authenticated-orcid":false,"given":"Christian","family":"Puchert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-3219-1206","authenticated-orcid":false,"given":"Tuomo","family":"Takkula","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,5,25]]},"reference":[{"key":"17_CR1","doi-asserted-by":"publisher","unstructured":"Achterberg, T.: Constraint Integer Programming. Ph.D. thesis, TU Berlin (2007). https:\/\/doi.org\/10.14279\/depositonce-1634","DOI":"10.14279\/depositonce-1634"},{"key":"17_CR2","doi-asserted-by":"publisher","unstructured":"Beck, J.C.: Checking-up on branch-and-check. In: Cohen, D. (ed.) CP 2010. LNCS, vol. 6308, pp. 84\u201398. Springer, Berlin, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15396-9_10. ISBN 978-3-642-15396-9","DOI":"10.1007\/978-3-642-15396-9_10"},{"issue":"2","key":"17_CR3","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1109\/MCSE.2010.118","volume":"13","author":"S Behnel","year":"2011","unstructured":"Behnel, S., Bradshaw, R., Citro, C., Dalcin, L., Seljebotn, D.S., Smith, K.: Cython: the best of both worlds. Comput. Sci. Eng. 13(2), 31\u201339 (2011). https:\/\/doi.org\/10.1109\/MCSE.2010.118","journal-title":"Comput. Sci. Eng."},{"issue":"1","key":"17_CR4","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"JF Benders","year":"1962","unstructured":"Benders, J.F.: Partitioning procedures for solving mixed-variables programming problems. Numer. Math. 4(1), 238\u2013252 (1962). https:\/\/doi.org\/10.1007\/BF01386316","journal-title":"Numer. Math."},{"key":"17_CR5","unstructured":"Brandt, F.: Aclpp instances. https:\/\/github.com\/fbrandt\/ACLPP. commit: 3516c2b"},{"key":"17_CR6","doi-asserted-by":"publisher","unstructured":"Brandt, F.: The Air Cargo Load Planning Problem. Ph.D. thesis, Karlsruher Institut f\u00fcr Technologie (KIT) (2017). https:\/\/doi.org\/10.5445\/IR\/1000075507","DOI":"10.5445\/IR\/1000075507"},{"key":"17_CR7","doi-asserted-by":"publisher","unstructured":"Brandt, F., Nickel, S.: The air cargo load planning problem - a consolidated problem definition and literature review on related problems. Eur. J. Oper. Res. 275(2), 399\u2013410 (2019). https:\/\/doi.org\/10.1016\/j.ejor.2018.07.013. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0377221718306180. ISSN 0377-2217","DOI":"10.1016\/j.ejor.2018.07.013"},{"key":"17_CR8","doi-asserted-by":"publisher","unstructured":"Emde, S., Abedinnia, H., Lange, A., Glock, C.H.: Scheduling personnel for the build-up of unit load devices at an air cargo terminal with limited space. OR Spect. 42(2), 397\u2013426 (2020). https:\/\/doi.org\/10.1007\/s00291-020-00580-2","DOI":"10.1007\/s00291-020-00580-2"},{"key":"17_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2019.104777","volume":"113","author":"S Emde","year":"2020","unstructured":"Emde, S., Polten, L., Gendreau, M.: Logic-based benders decomposition for scheduling a batching machine. Comput. Oper. Res. 113, 104777 (2020). https:\/\/doi.org\/10.1016\/j.cor.2019.104777","journal-title":"Comput. Oper. Res."},{"key":"17_CR10","doi-asserted-by":"publisher","unstructured":"Euler, R., Bornd\u00f6rfer, R., Strunk, T., Takkula, T.: Uld build-up scheduling with dynamic batching in an air freight hub. In: Trautmann, N., Gn\u00e4gi, M. (eds.) Operations Research Proceedings 2021, pp. 254\u2013260. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-08623-6_38","DOI":"10.1007\/978-3-031-08623-6_38"},{"key":"17_CR11","unstructured":"Gurobi Optimization, LLC: Gurobi Optimizer Reference Manual (2023). https:\/\/www.gurobi.com"},{"issue":"3","key":"17_CR12","doi-asserted-by":"publisher","first-page":"588","DOI":"10.1287\/opre.1060.0371","volume":"55","author":"JN Hooker","year":"2007","unstructured":"Hooker, J.N.: Planning and scheduling by logic-based benders decomposition. Oper. Res. 55(3), 588\u2013602 (2007). https:\/\/doi.org\/10.1287\/opre.1060.0371","journal-title":"Oper. Res."},{"issue":"1","key":"17_CR13","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(1), 33\u201360 (2003). https:\/\/doi.org\/10.1007\/s10107-003-0375-9","journal-title":"Math. Program."},{"key":"17_CR14","doi-asserted-by":"publisher","unstructured":"Hooker, J.: Logic-based benders decomposition: theory and applications. In: Synthesis Lectures on Operations Research and Applications. Springer, Heidelberg (2024). https:\/\/doi.org\/10.1007\/978-3-031-45039-6","DOI":"10.1007\/978-3-031-45039-6"},{"key":"17_CR15","doi-asserted-by":"publisher","unstructured":"Hooker, J.N.: Logic-based benders decomposition for large-scale optimization. In: Vel\u00e1squez-Berm\u00fadez, J.M., Khakifirooz, M., Fathi, M. (eds.) Large Scale Optimization in Supply Chains and Smart Manufacturing: Theory and Applications, pp. 1\u201326. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-22788-3_1","DOI":"10.1007\/978-3-030-22788-3_1"},{"issue":"3","key":"17_CR16","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1287\/trsc.32.3.295","volume":"32","author":"Y Nobert","year":"1998","unstructured":"Nobert, Y., Roy, J.: Freight handling personnel scheduling at air cargo terminals. Transport. Sci. 32(3), 295\u2013301 (1998). https:\/\/doi.org\/10.1287\/trsc.32.3.295","journal-title":"Transport. Sci."},{"key":"17_CR17","unstructured":"Perron, L., Didier, F.: OR-Tools CP-SAT v9.6. https:\/\/developers.goo-gle.com\/optimization\/cp\/cp_solver\/"},{"key":"17_CR18","doi-asserted-by":"publisher","unstructured":"Pinedo, M.L.: Scheduling, vol.\u00a029. Springer, Cham (2012). https:\/\/doi.org\/10.1007\/978-3-319-26580-3","DOI":"10.1007\/978-3-319-26580-3"},{"issue":"3","key":"17_CR19","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1016\/j.ejor.2016.12.005","volume":"259","author":"R Rahmaniani","year":"2017","unstructured":"Rahmaniani, R., Crainic, T.G., Gendreau, M., Rei, W.: The benders decomposition algorithm: a literature review. Eur. J. Oper. Res. 259(3), 801\u2013817 (2017). https:\/\/doi.org\/10.1016\/j.ejor.2016.12.005","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"17_CR20","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1016\/j.tre.2009.01.005","volume":"45","author":"A Rong","year":"2009","unstructured":"Rong, A., Grunow, M.: Shift designs for freight handling personnel at air cargo terminals. Transport. Res. Part E: Logist. Transport. Rev. 45(5), 725\u2013739 (2009). https:\/\/doi.org\/10.1016\/j.tre.2009.01.005","journal-title":"Transport. Res. Part E: Logist. Transport. Rev."},{"key":"17_CR21","doi-asserted-by":"publisher","unstructured":"Thorsteinsson, E.S.: Branch-and-check: a hybrid framework integrating mixed integer programming and constraint logic programming. In: Walsh, T. (ed.) Principles and Practice of Constraint Programming\u2014CP 2001, pp. 16\u201330. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45578-7_2","DOI":"10.1007\/3-540-45578-7_2"},{"issue":"3","key":"17_CR22","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1002\/asmb.710","volume":"24","author":"S Yan","year":"2008","unstructured":"Yan, S., Chen, C.H., Chen, M.: Stochastic models for air cargo terminal manpower supply planning in long-term operations. Appl. Stochastic Models Bus. Ind. 24(3), 261\u2013275 (2008). https:\/\/doi.org\/10.1002\/asmb.710","journal-title":"Appl. Stochastic Models Bus. Ind."},{"issue":"1","key":"17_CR23","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s10479-011-1031-z","volume":"210","author":"E \u00c7oban","year":"2013","unstructured":"\u00c7oban, E., Hooker, J.: Single-facility scheduling by logic-based Benders decomposition. Ann. Oper. Res. 210(1), 245\u2013272 (2013). https:\/\/doi.org\/10.1007\/s10479-011-1031-z","journal-title":"Ann. Oper. Res."},{"key":"17_CR24","doi-asserted-by":"publisher","unstructured":"\u00c7oban, E., Hooker, J.N.: Single-facility scheduling over long time horizons by logic-based benders decomposition. In: Lodi, A., Milano, M., Toth, P. (eds.) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, pp. 87\u201391. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13520-0_11","DOI":"10.1007\/978-3-642-13520-0_11"}],"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-60597-0_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,27]],"date-time":"2024-05-27T14:07:12Z","timestamp":1716818832000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-60597-0_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031605963","9783031605970"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-60597-0_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"25 May 2024","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":"CPAIOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Uppsala","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sweden","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":"28 May 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 May 2024","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":"cpaior2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/view\/cpaior2024","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}