{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T23:50:34Z","timestamp":1776901834878,"version":"3.51.2"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032167071","type":"print"},{"value":"9783032167088","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-16708-8_33","type":"book-chapter","created":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T23:28:35Z","timestamp":1776900515000},"page":"412-425","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An LBBD Approach for\u00a0Solving the\u00a0Chemotherapy Treatment Scheduling Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2724-4342","authenticated-orcid":false,"given":"Simone","family":"Caruso","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5617-5286","authenticated-orcid":false,"given":"Carmine","family":"Dodaro","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9034-2527","authenticated-orcid":false,"given":"Marco","family":"Maratea","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3920-8186","authenticated-orcid":false,"given":"Cinzia","family":"Marte","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5849-3667","authenticated-orcid":false,"given":"Marco","family":"Mochi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,4,1]]},"reference":[{"key":"33_CR1","unstructured":"Alviano, M., et al.: Answer set programming in healthcare: extended overview. In: IPS and RCRA 2020. CEUR Workshop Proceedings, vol.\u00a02745. CEUR-WS.org (2020)"},{"issue":"3","key":"33_CR2","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.entcs.2004.06.065","volume":"125","author":"A Armando","year":"2005","unstructured":"Armando, A., Castellini, C., Giunchiglia, E., Idini, M., Maratea, M.: TSAT++: an open platform for satisfiability modulo theories. Electron. Notes Theor. Comput. Sci. 125(3), 25\u201336 (2005)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"33_CR3","doi-asserted-by":"crossref","unstructured":"Benders, J.: Partitioning procedures for solving mixed-variables programming problems. Comput. Manage. Sci. 2(1) (2005)","DOI":"10.1007\/s10287-004-0020-y"},{"issue":"12","key":"33_CR4","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1145\/2043174.2043195","volume":"54","author":"G Brewka","year":"2011","unstructured":"Brewka, G., Eiter, T., Truszczynski, M.: Answer set programming at a glance. Commun. ACM 54(12), 92\u2013103 (2011)","journal-title":"Commun. ACM"},{"key":"33_CR5","doi-asserted-by":"crossref","unstructured":"Bruno, P., Calimeri, F., Marte, C.: Dedudeep: an extensible framework for combining deep learning and asp-based models. In: Gottlob, G., Inclezan, D., Maratea, M. (eds.) Proceedings of the 16th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2022). LNCS, vol. 13416, pp. 505\u2013510. Springer, Cham (2022)","DOI":"10.1007\/978-3-031-15707-3_39"},{"issue":"5","key":"33_CR6","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1109\/69.877512","volume":"12","author":"F Buccafurri","year":"2000","unstructured":"Buccafurri, F., Leone, N., Rullo, P.: Enhancing disjunctive datalog by constraints. IEEE Trans. Knowl. Data Eng. 12(5), 845\u2013860 (2000)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"2","key":"33_CR7","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1017\/S1471068419000450","volume":"20","author":"F Calimeri","year":"2020","unstructured":"Calimeri, F., et al.: ASP-Core-2 input language format. Theory Pract. Logic Program. 20(2), 294\u2013309 (2020)","journal-title":"Theory Pract. Logic Program."},{"key":"33_CR8","unstructured":"Cappanera, P., et al.: Recent answer set programming applications to scheduling problems in digital health. In: Proceedings of AI4CC-IPS-RCRA-SPIRIT 2024 workshops, co-located with AIxIA 2024. CEUR Workshop Proceedings, vol.\u00a03883. CEUR-WS.org (2024)"},{"issue":"4","key":"33_CR9","doi-asserted-by":"publisher","first-page":"848","DOI":"10.1017\/S147106842300025X","volume":"23","author":"P Cappanera","year":"2023","unstructured":"Cappanera, P., Gavanelli, M., Nonato, M., Roma, M.: Logic-based Benders decomposition in answer set programming for chronic outpatients scheduling. Theory Pract. Logic Program. 23(4), 848\u2013864 (2023)","journal-title":"Theory Pract. Logic Program."},{"key":"33_CR10","doi-asserted-by":"crossref","unstructured":"Cardellini, M., et al.: A two-phase ASP encoding for solving rehabilitation scheduling. In: Proceedings of RuleML+RR 2021. LNCS, vol. 12851, pp. 111\u2013125. Springer, Cham (2021)","DOI":"10.1007\/978-3-030-91167-6_8"},{"key":"33_CR11","unstructured":"Cir\u00e9, A., Hooker, J.N.: A heuristic logic-based benders method for the home health care problem. In: Manuscript, presented at Matheuristics (2012)"},{"issue":"8","key":"33_CR12","doi-asserted-by":"publisher","first-page":"1556","DOI":"10.1093\/logcom\/exae041","volume":"34","author":"C Dodaro","year":"2024","unstructured":"Dodaro, C., et al.: Operating room scheduling via answer set programming: improved encoding and test on real data. J. Log. Comput. 34(8), 1556\u20131579 (2024)","journal-title":"J. Log. Comput."},{"issue":"6","key":"33_CR13","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1017\/S1471068421000363","volume":"21","author":"C Dodaro","year":"2021","unstructured":"Dodaro, C., Galat\u00e0, G., Grioni, A., Maratea, M., Mochi, M., Porro, I.: An ASP-based solution to the chemotherapy treatment scheduling problem. Theory Pract. Logic Program. 21(6), 835\u2013851 (2021)","journal-title":"Theory Pract. Logic Program."},{"key":"33_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-030-31095-0_5","volume-title":"Rules and Reasoning","author":"C Dodaro","year":"2019","unstructured":"Dodaro, C., Galat\u00e0, G., Khan, M.K., Maratea, M., Porro, I.: An ASP-based solution for operating room scheduling with beds management. In: Fodor, P., Montali, M., Calvanese, D., Roman, D. (eds.) RuleML+RR 2019. LNCS, vol. 11784, pp. 67\u201381. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-31095-0_5"},{"key":"33_CR15","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/978-3-030-03840-3_33","volume-title":"AI*IA 2018 \u2013 Advances in Artificial Intelligence","author":"C Dodaro","year":"2018","unstructured":"Dodaro, C., Galat\u00e0, G., Maratea, M., Porro, I.: Operating room scheduling via answer set programming. In: Ghidini, C., Magnini, B., Passerini, A., Traverso, P. (eds.) AI*IA 2018. LNCS (LNAI), vol. 11298, pp. 445\u2013459. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03840-3_33"},{"issue":"1","key":"33_CR16","doi-asserted-by":"publisher","first-page":"63","DOI":"10.3233\/IA-190020","volume":"13","author":"C Dodaro","year":"2019","unstructured":"Dodaro, C., Galat\u00e0, G., Maratea, M., Porro, I.: An ASP-based framework for operating room scheduling. Intelligenza Artificiale 13(1), 63\u201377 (2019)","journal-title":"Intelligenza Artificiale"},{"issue":"3","key":"33_CR17","first-page":"53","volume":"37","author":"E Erdem","year":"2016","unstructured":"Erdem, E., Gelfond, M., Leone, N.: Applications of answer set programming. AI Mag. 37(3), 53\u201368 (2016)","journal-title":"AI Mag."},{"issue":"1","key":"33_CR18","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/j.artint.2010.04.002","volume":"175","author":"W Faber","year":"2011","unstructured":"Faber, W., Pfeifer, G., Leone, N.: Semantics and complexity of recursive aggregates in answer set programming. Artif. Intell. 175(1), 278\u2013298 (2011)","journal-title":"Artif. Intell."},{"key":"33_CR19","doi-asserted-by":"crossref","unstructured":"Falkner, A.A., Friedrich, G., Schekotihin, K., Taupe, R., Teppan, E.C.: Industrial applications of answer set programming. KI 32(2-3), 165\u2013176 (2018)","DOI":"10.1007\/s13218-018-0548-6"},{"key":"33_CR20","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Ostrowski, M., Schaub, T., Wanko, P.: Theory solving made easy with clingo 5. In: Proceedings of ICLP (Technical Communications). OASICS, vol.\u00a052, pp. 2:1\u20132:15. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2016)"},{"issue":"1","key":"33_CR21","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1017\/S1471068418000054","volume":"19","author":"M Gebser","year":"2019","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: Multi-shot ASP solving with clingo. Theory Pract. Logic Program. 19(1), 27\u201382 (2019)","journal-title":"Theory Pract. Logic Program."},{"key":"33_CR22","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/BF00934810","volume":"10","author":"AM Geoffrion","year":"1972","unstructured":"Geoffrion, A.M.: Generalized benders decomposition. J. Optim. Theory Appl. 10, 237\u2013260 (1972)","journal-title":"J. Optim. Theory Appl."},{"issue":"4","key":"33_CR23","first-page":"1551","volume":"33","author":"C Guo","year":"2021","unstructured":"Guo, C., Bodur, M., Aleman, D.M., Urbach, D.R.: Logic-based benders decomposition and binary decision diagram based approaches for stochastic distributed operating room scheduling. INFORMS J. Comput. 33(4), 1551\u20131569 (2021)","journal-title":"INFORMS J. Comput."},{"issue":"4","key":"33_CR24","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/s10729-014-9268-0","volume":"17","author":"S Hahn-Goldberg","year":"2014","unstructured":"Hahn-Goldberg, S., Carter, M.W., Beck, J.C., Trudeau, M., Sousa, P., Beattie, K.: Dynamic optimization of chemotherapy outpatient scheduling with uncertainty. Health Care Manag. Sci. 17(4), 379\u2013392 (2014). https:\/\/doi.org\/10.1007\/s10729-014-9268-0","journal-title":"Health Care Manag. Sci."},{"key":"33_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-319-33954-2_14","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"A Heching","year":"2016","unstructured":"Heching, A., Hooker, J.N.: Scheduling home hospice care with logic-based benders decomposition. In: Quimper, C.-G. (ed.) CPAIOR 2016. LNCS, vol. 9676, pp. 187\u2013197. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-33954-2_14"},{"issue":"2","key":"33_CR26","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1287\/trsc.2018.0830","volume":"53","author":"A Heching","year":"2019","unstructured":"Heching, A., Hooker, J.N., Kimura, R.: A logic-based benders approach to home healthcare delivery. Transp. Sci. 53(2), 510\u2013522 (2019)","journal-title":"Transp. Sci."},{"key":"33_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-540-30201-8_24","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"JN Hooker","year":"2004","unstructured":"Hooker, J.N.: A hybrid method for planning and scheduling. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 305\u2013316. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30201-8_24"},{"key":"33_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-45039-6","volume-title":"Logic-Based Benders Decomposition: Theory and Applications","author":"J Hooker","year":"2024","unstructured":"Hooker, J.: Logic-Based Benders Decomposition: Theory and Applications. Springer, Cham (2024)"},{"issue":"1","key":"33_CR29","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s10107-003-0375-9","volume":"96","author":"J Hooker","year":"2003","unstructured":"Hooker, J., Ottosson, G.: Logic-based benders decomposition. Math. Program. 96(1), 33\u201360 (2003)","journal-title":"Math. Program."},{"issue":"2","key":"33_CR30","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1200\/JOP.2017.025510","volume":"14","author":"YL Huang","year":"2017","unstructured":"Huang, Y.L., Bryce, A.H., Culbertson, T., Connor, S.L., Looker, S.A., et al.: Alternative outpatient chemotherapy scheduling method to improve patient service quality and nurse satisfaction. J. Oncol. Pract. 14(2), 82\u201391 (2017)","journal-title":"J. Oncol. Pract."},{"key":"33_CR31","unstructured":"Huggins, A., Claudio, D., P\u00e9rez, E.: Improving resource utilization in a cancer clinic: an optimization model. In: IIE Annual Conference and Expo 2014 (2014)"},{"issue":"3","key":"33_CR32","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)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"33_CR33","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1016\/j.ejor.2016.06.015","volume":"255","author":"A Riise","year":"2016","unstructured":"Riise, A., Mannino, C., Lamorgese, L.: Recursive logic-based benders\u2019 decomposition for multi-mode outpatient scheduling. Eur. J. Oper. Res. 255(3), 719\u2013728 (2016)","journal-title":"Eur. J. Oper. Res."},{"key":"33_CR34","doi-asserted-by":"crossref","unstructured":"Roshanaei, V., Luong, C., Aleman, D.M., Urbach, D.: Propagating logic-based benders\u2019 decomposition approaches for distributed operating room scheduling. Eur. J. Oper. Res. 257(2) (2017)","DOI":"10.1016\/j.ejor.2016.08.024"},{"issue":"12","key":"33_CR35","doi-asserted-by":"publisher","first-page":"2103","DOI":"10.1016\/j.compbiomed.2013.10.012","volume":"43","author":"S Sevinc","year":"2013","unstructured":"Sevinc, S., Sanli, U.A., Goker, E.: Algorithms for scheduling of chemotherapy plans. Comput. Biol. Med. 43(12), 2103\u20132109 (2013)","journal-title":"Comput. Biol. Med."}],"container-title":["Communications in Computer and Information Science","Artificial Intelligence for Healthcare, and Hybrid Models for Coupling Deductive and Inductive Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-16708-8_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T23:28:37Z","timestamp":1776900517000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-16708-8_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032167071","9783032167088"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-16708-8_33","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"value":"1865-0929","type":"print"},{"value":"1865-0937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"1 April 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"HC_AIxIA_HYDRA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Joint Workshop on Artificial Intelligence for Healthcare, and Hybrid Models for Coupling Deductive and Inductive Reasoning","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bologna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"25 October 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 October 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"hc_aixia_hydra2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/unical.it\/hcaixia-hydra-2025\/home","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}