{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T16:06:31Z","timestamp":1784217991349,"version":"3.55.0"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031959721","type":"print"},{"value":"9783031959738","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-3-031-95973-8_14","type":"book-chapter","created":{"date-parts":[[2025,6,28]],"date-time":"2025-06-28T04:01:02Z","timestamp":1751083262000},"page":"222-238","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Learning Primal Heuristics for\u00a00\u20131 Knapsack Interdiction Problems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8903-2871","authenticated-orcid":false,"given":"Luca","family":"Ferrarini","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2111-3528","authenticated-orcid":false,"given":"Stefano","family":"Gualandi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Letizia","family":"Moro","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1762-4947","authenticated-orcid":false,"given":"Axel","family":"Parmentier","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,6,29]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Assi, M., Haraty, R.A.: A survey of the Knapsack Problem. In: 2018 International Arab Conference on Information Technology (ACIT), pp. 1\u20136. IEEE (2018)","DOI":"10.1109\/ACIT.2018.8672677"},{"issue":"6","key":"14_CR2","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1016\/0010-4825(87)90060-6","volume":"17","author":"N Assimakopoulos","year":"1987","unstructured":"Assimakopoulos, N.: A network interdiction model for hospital infection control. Comput. Biol. Med. 17(6), 413\u2013422 (1987)","journal-title":"Comput. Biol. Med."},{"issue":"2","key":"14_CR3","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1287\/opre.2020.2014","volume":"69","author":"A Baggio","year":"2021","unstructured":"Baggio, A., Carvalho, M., Lodi, A., Tramontani, A.: Multilevel approaches for the critical node problem. Oper. Res. 69(2), 486\u2013508 (2021)","journal-title":"Oper. Res."},{"issue":"6","key":"14_CR4","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1090\/S0002-9904-1954-09848-8","volume":"60","author":"R Bellman","year":"1954","unstructured":"Bellman, R.: The theory of dynamic programming. Bull. Am. Math. Soc. 60(6), 503\u2013515 (1954)","journal-title":"Bull. Am. Math. Soc."},{"key":"14_CR5","unstructured":"Berthet, Q., Blondel, M., Teboul, O., Cuturi, M., Vert, J.P., Bach, F.: Learning with differentiable perturbed optimizers. In:\u00a0Larochelle, H.,\u00a0Ranzato, M.,\u00a0Hadsell, R., Balcan, M.F.,\u00a0Lin, H. (eds.) Advances in Neural Information Processing Systems, vol. 33, pp. 9508\u20139519 (2020)"},{"issue":"35","key":"14_CR6","first-page":"1","volume":"21","author":"M Blondel","year":"2020","unstructured":"Blondel, M., Martins, A., Niculae, V.: Learning with Fenchel-Young losses. J. Mach. Learn. Res. 21(35), 1\u201369 (2020)","journal-title":"J. Mach. Learn. Res."},{"issue":"3","key":"14_CR7","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/j.orl.2009.01.007","volume":"37","author":"L Brotcorne","year":"2009","unstructured":"Brotcorne, L., Hanafi, S., Mansi, R.: A dynamic programming algorithm for the bilevel knapsack problem. Oper. Res. Lett. 37(3), 215\u2013218 (2009)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"14_CR8","doi-asserted-by":"publisher","first-page":"823","DOI":"10.1137\/130906593","volume":"24","author":"A Caprara","year":"2014","unstructured":"Caprara, A., Carvalho, M., Lodi, A., Woeginger, G.J.: A study on the computational complexity of the bilevel knapsack problem. SIAM J. Optim. 24(2), 823\u2013838 (2014)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"14_CR9","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1287\/ijoc.2015.0676","volume":"28","author":"A Caprara","year":"2016","unstructured":"Caprara, A., Carvalho, M., Lodi, A., Woeginger, G.J.: Bilevel knapsack with interdiction constraints. INFORMS J. Comput. 28(2), 319\u2013333 (2016)","journal-title":"INFORMS J. Comput."},{"key":"14_CR10","unstructured":"Dalle, G., Baty, L., Bouvier, L., Parmentier, A.: Learning with combinatorial optimization layers: a probabilistic approach (2022)"},{"key":"14_CR11","unstructured":"Danskin, J.M.: The theory of max-min and its application to weapons allocation problems, vol.\u00a05. Springer, Heidelberg (2012)"},{"issue":"1\u20132","key":"14_CR12","first-page":"249","volume":"183","author":"FD Croce","year":"2020","unstructured":"Croce, F.D., Scatamacchia, R.: An exact approach for the bilevel Knapsack Problem with interdiction constraints and extensions. Math. Program. 183(1\u20132), 249\u2013281 (2020)","journal-title":"Math. Program."},{"key":"14_CR13","unstructured":"Denegre, S.: Interdiction and discrete bilevel linear programming. PhD thesis, Lehigh University, USA (2011)"},{"issue":"6","key":"14_CR14","doi-asserted-by":"publisher","first-page":"1615","DOI":"10.1287\/opre.2017.1650","volume":"65","author":"M Fischetti","year":"2017","unstructured":"Fischetti, M., Ljubi\u0107, I., Monaci, M., Sinnl, M.: A new general-purpose algorithm for mixed-integer bilevel linear programs. Oper. Res. 65(6), 1615\u20131637 (2017)","journal-title":"Oper. Res."},{"key":"14_CR15","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.ejor.2017.11.043","volume":"267","author":"M Fischetti","year":"2018","unstructured":"Fischetti, M., Monaci, M., Sinnl, M.: A dynamic reformulation heuristic for generalized interdiction problems. Eur. J. Oper. Res. 267, 40\u201351 (2018)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"14_CR16","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1287\/ijoc.2018.0831","volume":"31","author":"M Fischetti","year":"2019","unstructured":"Fischetti, M., Ljubi\u0107, I., Monaci, M., Sinnl, M.: Interdiction games and monotonicity, with application to Knapsack Problems. INFORMS J. Comput. 31(2), 390\u2013410 (2019)","journal-title":"INFORMS J. Comput."},{"issue":"4","key":"14_CR17","doi-asserted-by":"publisher","first-page":"2399","DOI":"10.1287\/opre.2021.2110","volume":"70","author":"F Furini","year":"2022","unstructured":"Furini, F., Ljubi\u0107, I., Malaguti, E., Paronuzzi, P.: Casting light on the hidden bilevel combinatorial structure of the capacitated vertex separator problem. Oper. Res. 70(4), 2399\u20132420 (2022)","journal-title":"Oper. Res."},{"issue":"3","key":"14_CR18","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1016\/j.ejor.2021.12.009","volume":"301","author":"J Jooken","year":"2022","unstructured":"Jooken, J., Leyman, P., De Causmaecker, P.: A new class of hard problem instances for the 0\u20131 Knapsack Problem. Eur. J. Oper. Res. 301(3), 841\u2013854 (2022). ISSN 0377-2217","journal-title":"Eur. J. Oper. Res."},{"key":"14_CR19","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejco.2021.100007","volume":"9","author":"T Kleinert","year":"2021","unstructured":"Kleinert, T., Labb\u00e9, M., Ljubi\u0107, I., Schmidt, M.: A survey on mixed-integer programming techniques in bilevel optimization. EURO J. Comput. Optim. 9, 100007 (2021). ISSN 2192-4406","journal-title":"EURO J. Comput. Optim."},{"key":"14_CR20","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1287\/mnsc.13.9.723","volume":"13","author":"P Kolesar","year":"1967","unstructured":"Kolesar, P.: A branch and bound algorithm for the Knapsack Problem. Manag. Sci. 13, 723\u2013735 (1967)","journal-title":"Manag. Sci."},{"key":"14_CR21","doi-asserted-by":"publisher","unstructured":"Kwon, S., Choi, H., Park, S.: Deep learning based high accuracy heuristic approach for knapsack interdiction problem. Comput. Oper. Res. 176, 106965 (2025). ISSN 0305-0548. https:\/\/doi.org\/10.1016\/j.cor.2024.106965. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0305054824004374","DOI":"10.1016\/j.cor.2024.106965"},{"key":"14_CR22","unstructured":"Li, D., et al.: A novel method to solve neural Knapsack Problems. In: Meila, M., Zhang, T. (eds.) Proceedings of the 38th International Conference on Machine Learning, vol. 139 of Proceedings of Machine Learning Research, pp. 6414\u20136424 (2021)"},{"key":"14_CR23","volume-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"S Martello","year":"1990","unstructured":"Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations. Wiley, Hoboken (1990). ISBN 9780471924203"},{"issue":"1","key":"14_CR24","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1112\/plms\/s1-28.1.486","volume":"1","author":"GB Mathews","year":"1896","unstructured":"Mathews, G.B.: On the of numbers. Proc. Lond. Math. Soc. 1(1), 486\u2013490 (1896)","journal-title":"Proc. Lond. Math. Soc."},{"issue":"5","key":"14_CR25","doi-asserted-by":"publisher","first-page":"911","DOI":"10.1287\/opre.38.5.911","volume":"38","author":"JT Moore","year":"1990","unstructured":"Moore, J.T., Bard, J.F.: The mixed integer linear bilevel programming problem. Oper. Res. 38(5), 911\u2013921 (1990)","journal-title":"Oper. Res."},{"key":"14_CR26","unstructured":"Niculae, V., Martins, A.F.T., Blondel, M., Cardie, C.: Sparsemap: differentiable sparse structured inference. In: International Conference on Machine Learning (2018)"},{"issue":"5","key":"14_CR27","doi-asserted-by":"publisher","first-page":"758","DOI":"10.1287\/opre.45.5.758","volume":"45","author":"D Pisinger","year":"1997","unstructured":"Pisinger, D.: A minimal algorithm for the 0\u20131 Knapsack Problem. Oper. Res. 45(5), 758\u2013767 (1997)","journal-title":"Oper. Res."},{"issue":"9","key":"14_CR28","doi-asserted-by":"publisher","first-page":"2271","DOI":"10.1016\/j.cor.2004.03.002","volume":"32","author":"D Pisinger","year":"2005","unstructured":"Pisinger, D.: Where are the hard Knapsack Problems? Comput. Oper. Res. 32(9), 2271\u20132284 (2005). ISSN 0305-0548","journal-title":"Comput. Oper. Res."},{"key":"14_CR29","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s10898-015-0274-7","volume":"66","author":"Y Tang","year":"2016","unstructured":"Tang, Y., Richard, J.-P.P., Smith, J.C.: A class of algorithms for mixed-integer bilevel min-max optimization. J. Glob. Optim. 66, 225\u2013262 (2016)","journal-title":"J. Glob. Optim."},{"key":"14_CR30","doi-asserted-by":"crossref","unstructured":"Weninger, N., Fukasawa, R.: A fast combinatorial algorithm for the bilevel knapsack problem with interdiction constraints. Math. Program., 1\u201333 (2024)","DOI":"10.1007\/s10107-024-02133-9"}],"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-95973-8_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T15:40:34Z","timestamp":1784216434000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-95973-8_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031959721","9783031959738"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-95973-8_14","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":"29 June 2025","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 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":"Melbourne, VIC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","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":"10 November 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 November 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/view\/cpaior2025","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}