{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T16:12:18Z","timestamp":1765383138463,"version":"3.46.0"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T00:00:00Z","timestamp":1750809600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T00:00:00Z","timestamp":1750809600000},"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":["Oper. Res. Forum"],"DOI":"10.1007\/s43069-025-00496-z","type":"journal-article","created":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T07:36:00Z","timestamp":1750836960000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Identifying Knapsack Problems with Conflicts that Are Difficult to Solve Optimally Using General-Purpose Integer Programming Software"],"prefix":"10.1007","volume":"6","author":[{"given":"Myung Soon","family":"Song","sequence":"first","affiliation":[]},{"given":"Pei Hua","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Yun","family":"Lu","sequence":"additional","affiliation":[]},{"given":"Francis J.","family":"Vasko","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,6,25]]},"reference":[{"issue":"3","key":"496_CR1","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1287\/ijoc.2016.0742","volume":"29","author":"A Bettinelli","year":"2017","unstructured":"Bettinelli A, Cacciani V, Malaguti E (2017) A branch-and-bound algorithm for the knapsack problem with conflict graph. INFORMS J Comput 29(3):457\u2013473","journal-title":"INFORMS J Comput"},{"key":"496_CR2","doi-asserted-by":"publisher","first-page":"105692","DOI":"10.1016\/j.cor.2021.105692","volume":"143","author":"V Cacchiani","year":"2022","unstructured":"Cacchiani V, Lori M, Locvatelli A, Martello S (2022) Knapsack problems-an overview of recent advances. Part I: single knapsack problems. Comput Oper Res 143:105692","journal-title":"Comput Oper Res"},{"key":"496_CR3","doi-asserted-by":"publisher","first-page":"105693","DOI":"10.1016\/j.cor.2021.105693","volume":"143","author":"V Cacchiani","year":"2022","unstructured":"Cacchiani V, Lori M, Locvatelli A, Martello S (2022b) Knapsack problems-an overview of recent advances. Part II: multiple, multidimensional, and quadratic knapsack problems. Comput Oper Res 143:105693","journal-title":"Comput Oper Res"},{"key":"496_CR4","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1007\/s00500-021-06331-x","volume":"26","author":"G Capobianco","year":"2022","unstructured":"Capobianco G, D\u2019Ambrosio C, Pavone L, Raiconi A, Vitale G, Sebastiano F (2022) A hybrid metaheuristic for the knapsack problem with forfeits. Soft Comput 26:749\u2013762. https:\/\/doi.org\/10.1007\/s00500-021-06331-x","journal-title":"Soft Comput"},{"key":"496_CR5","doi-asserted-by":"publisher","unstructured":"Cerulli R, D\u2019Ambrosio C, Raiconi A, Vitale G (2020) The knapsack problem with forfeits. In: Combinatorial Optimization: 6th International Symposium, ISCO 2020, Montreal, QC, Canada, May, 2020. 4\u20136, Revised Selected Papers. Springer, Berlin, Heidelberg, pp 263\u2013272. https:\/\/doi.org\/10.1007\/978-3-030-53262-8_22","DOI":"10.1007\/978-3-030-53262-8_22"},{"key":"496_CR6","doi-asserted-by":"publisher","first-page":"435","DOI":"10.10116\/ejor.2020.07.023","volume":"289","author":"S Coniglio","year":"2021","unstructured":"Coniglio S, Furini F, San Segundo P (2021) A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts. Eur J Oper Res 289:435\u2013455. https:\/\/doi.org\/10.10116\/ejor.2020.07.023","journal-title":"Eur J Oper Res"},{"key":"496_CR7","unstructured":"Fletcher GS (2020) Clinical epidemiology: the essentials, 6th edn. Lippincott Williams & Wilkins,\u00a0Philadelphia"},{"issue":"6","key":"496_CR8","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1057\/palgrave.jors.2602046","volume":"57","author":"M Hifi","year":"2006","unstructured":"Hifi M, Michrafy M (2006) A reactive local search-based algorithm for the disjunctively constrained knapsack problem. J Oper Res Soc 57(6):718\u2013726","journal-title":"J Oper Res Soc"},{"issue":"9","key":"496_CR9","doi-asserted-by":"publisher","first-page":"2657","DOI":"10.1016\/j.cor.2005.10.004","volume":"34","author":"M Hifi","year":"2007","unstructured":"Hifi M, Michrafy M (2007) Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem. Comput Oper Res 34(9):2657\u20132673","journal-title":"Comput Oper Res"},{"issue":"1","key":"496_CR10","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1504\/IJOR.2012.044026","volume":"13","author":"M Hifi","year":"2012","unstructured":"Hifi M, Otmani N (2012) An algorithm for the disjunctively constrained knap- sack problem. Int J Oper Res 13(1):22\u201343","journal-title":"Int J Oper Res"},{"issue":"8","key":"496_CR11","doi-asserted-by":"publisher","first-page":"1109","DOI":"10.1080\/0305215X.2013.819096","volume":"46","author":"M Hifi","year":"2014","unstructured":"Hifi M (2014) An iterative rounding search-based algorithm for the disjunctively constrained knapsack problem. Eng Optim 46(8):1109\u20131122","journal-title":"Eng Optim"},{"key":"496_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-7138-7","volume-title":"An introduction to statistical learning:with applications in R","author":"G James","year":"2013","unstructured":"James G, Witten D, Hastie T, Tibshirani R (2013) An introduction to statistical learning:with applications in R, 1st edn. Springer, Heidelberg","edition":"1"},{"key":"496_CR13","doi-asserted-by":"publisher","first-page":"106685","DOI":"10.1016\/j.cor.2024.106685","volume":"168","author":"R Jovanovic","year":"2024","unstructured":"Jovanovic R, Voss S (2024) Fixed set search matheuristic applied to the knapsack problem with forfeits. Comput Oper Res 168:106685","journal-title":"Comput Oper Res"},{"issue":"2","key":"496_CR14","doi-asserted-by":"publisher","first-page":"233","DOI":"10.7155\/jgaa.00186","volume":"13","author":"U Pferschy","year":"2009","unstructured":"Pferschy U, Schauer J (2009) The knapsack problem with conflict graphs. J Graph Algorithm Appl 13(2):233\u2013249","journal-title":"J Graph Algorithm Appl"},{"issue":"1","key":"496_CR15","doi-asserted-by":"publisher","first-page":"8052","DOI":"10.24294\/pnmai8052","volume":"1","author":"D Rando","year":"2024","unstructured":"Rando D, Yun L, Song MS, Vasko FJ (2024) The importance of fine-tuning Gurobi parameters when solving quadratic knapsack problems: a guide for OR practitioners. Pure New Math AI 1(1):8052. https:\/\/doi.org\/10.24294\/pnmai8052","journal-title":"Pure New Math AI"},{"issue":"5","key":"496_CR16","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/0167-6377(93)90093-V","volume":"14","author":"FJ Vasko","year":"1993","unstructured":"Vasko FJ, Creggar ML, Newhart DD, Stott KL (1993) A real-time one-dimensional cutting stock algorithm for balanced cutting patterns. Oper Res Lett 14(5):275\u2013282","journal-title":"Oper Res Lett"},{"issue":"3","key":"496_CR17","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1057\/ori.2008.13","volume":"21","author":"FJ Vasko","year":"2008","unstructured":"Vasko FJ, Stott KL (2008) Strategic planning: OR to the Rescue. OR Insight 21(3):26\u201332","journal-title":"OR Insight"},{"key":"496_CR18","first-page":"13","volume":"627","author":"FJ Vasko","year":"2023","unstructured":"Vasko FJ, Lu Y, Song MS (2023) Solving hard combinatorial optimization problems with general purpose integer programming software: a guide for OR practitioners. Inside OR 627:13","journal-title":"Inside OR"},{"issue":"9","key":"496_CR19","first-page":"2864","volume":"43","author":"T Yamada","year":"2002","unstructured":"Yamada T, Kataoka S, Watanabe K (2002) Heuristic and exact algorithms for the disjunctively constrained knapsack problem. J Inform Process (JIP) 43(9):2864\u20132870","journal-title":"J Inform Process (JIP)"},{"issue":"2","key":"496_CR20","doi-asserted-by":"publisher","first-page":"1432","DOI":"10.2307\/4586294","volume":"62","author":"J Yerushalmy","year":"1947","unstructured":"Yerushalmy J (1947) Statistical problems in assessing methods of medical diagnosis with special reference to x-ray techniques. Public Health Rep 62(2):1432\u20131439","journal-title":"Public Health Rep"},{"key":"496_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1111\/itor.13512","volume":"0","author":"Q Zhou","year":"2024","unstructured":"Zhou Q, Hao JK, Jiang ZZ, Wu Q (2024) Adaptive feasible and infeasible evolutionary search for the knapsack problem with forfeits. Inti Trans In Op Res 0:1\u201330. https:\/\/doi.org\/10.1111\/itor.13512","journal-title":"Inti Trans In Op Res"}],"container-title":["Operations Research Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-025-00496-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s43069-025-00496-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-025-00496-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T16:08:01Z","timestamp":1765382881000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s43069-025-00496-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,25]]},"references-count":21,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2025,9]]}},"alternative-id":["496"],"URL":"https:\/\/doi.org\/10.1007\/s43069-025-00496-z","relation":{},"ISSN":["2662-2556"],"issn-type":[{"type":"electronic","value":"2662-2556"}],"subject":[],"published":{"date-parts":[[2025,6,25]]},"assertion":[{"value":"8 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 June 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 June 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"88"}}