{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T12:48:19Z","timestamp":1776775699861,"version":"3.51.2"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2019,7,17]],"date-time":"2019-07-17T00:00:00Z","timestamp":1563321600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,7,17]],"date-time":"2019-07-17T00:00:00Z","timestamp":1563321600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2021,3]]},"DOI":"10.1007\/s10479-019-03290-3","type":"journal-article","created":{"date-parts":[[2019,7,17]],"date-time":"2019-07-17T16:03:37Z","timestamp":1563379417000},"page":"125-147","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["A modified descent method-based heuristic for binary quadratic knapsack problems with conflict graphs"],"prefix":"10.1007","volume":"298","author":[{"given":"Isma","family":"Dahmani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1031-7701","authenticated-orcid":false,"given":"Mhand","family":"Hifi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,17]]},"reference":[{"key":"3290_CR1","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1016\/S0377-2217(03)00244-3","volume":"157","author":"A Billionnet","year":"2004","unstructured":"Billionnet, A., & Soutif, E. (2004). An exact method based on Lagrangian decomposition for the 0\u20131 quadratic knapsack problem. European Journal of Operational Research, 157, 565\u2013575.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"3290_CR2","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1287\/opre.5.2.266","volume":"5","author":"GB Dantzig","year":"1957","unstructured":"Dantzig, G. B. (1957). Discrete-variable extremum problem. Operations Research, 5(2), 266\u2013288.","journal-title":"Operations Research"},{"key":"3290_CR3","unstructured":"GLPK. (2017). GNU linear programming kit. https:\/\/www.gnu.org\/software\/glpk\/; https:\/\/github.com\/PetterS\/glpk."},{"issue":"8","key":"3290_CR4","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. Engineering Optimization, 46(8), 1109\u20131122.","journal-title":"Engineering Optimization"},{"key":"3290_CR5","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. Journal of the Operational Research Society, 57, 718\u2013726.","journal-title":"Journal of the Operational Research Society"},{"issue":"9","key":"3290_CR6","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 knapsack problem. Computers and Operations Research, 34(9), 2657\u20132673.","journal-title":"Computers and Operations Research"},{"key":"3290_CR7","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1023\/A:1019920507008","volume":"23","author":"M Hifi","year":"2002","unstructured":"Hifi, M., Sadfi, S., & Sbihi, A. (2002). An efficient algorithm for the knapsack sharing problem. Computational Optimization and Applications, 23, 27\u201345.","journal-title":"Computational Optimization and Applications"},{"key":"3290_CR8","doi-asserted-by":"publisher","DOI":"10.1080\/23311916.2015.1068969","author":"M Hifi","year":"2015","unstructured":"Hifi, M., Saleh, S., & Wu, L. (2015). A hybrid guided neighborhood search for the disjunctively constrained knapsack problem. Cogent Engineering,. https:\/\/doi.org\/10.1080\/23311916.2015.1068969.","journal-title":"Cogent Engineering"},{"issue":"12","key":"3290_CR9","doi-asserted-by":"publisher","first-page":"1619","DOI":"10.1080\/0305215X.2014.982631","volume":"47","author":"M Hif","year":"2015","unstructured":"Hif, M., & Wu, L. (2015). Lagrangian heuristic-based neighborhood search for the multiple-choice multi-dimensional knapsack problem. Engineering Optimization, 47(12), 1619\u20131636.","journal-title":"Engineering Optimization"},{"key":"3290_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack problems","author":"H Kellerer","year":"2004","unstructured":"Kellerer, H., Pferschy, U., & Pisinger, D. (2004). Knapsack problems. Berlin: Springer."},{"key":"3290_CR11","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1287\/mnsc.45.3.414","volume":"45","author":"S Martello","year":"1999","unstructured":"Martello, S., Pisinger, D., & Toth, P. (1999). Dynamic programming and strong bounds for the 0?1 knapsack problem. Management Science, 45, 414\u2013424.","journal-title":"Management Science"},{"issue":"5","key":"3290_CR12","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1109\/TIT.1978.1055927","volume":"24","author":"M Merkle","year":"1978","unstructured":"Merkle, M., & Hellman, M. (1978). Hiding information and signatures in trapdoor knapsacks. IEEE Transactions on Information Theory, 24(5), 525\u2013530.","journal-title":"IEEE Transactions on Information Theory"},{"key":"3290_CR13","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1016\/j.sbspro.2014.01.101","volume":"111","author":"G Perboli","year":"2014","unstructured":"Perboli, G., Gobbato, L., & Perfetti, F. (2014). Packing problems in transportation and supply chain: New problems and trends. Procedia - Social and Behavioral Sciences, 111, 672\u2013681.","journal-title":"Procedia - Social and Behavioral Sciences"},{"key":"3290_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. Journal of Graph Algorithms and Applications, 13, 233\u2013249.","journal-title":"Journal of Graph Algorithms and Applications"},{"issue":"2","key":"3290_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3390\/su9020236","volume":"9","author":"X Shi","year":"2017","unstructured":"Shi, X., Wu, L., & Meng, X. (2017). A new optimization model for the sustainable development: Quadratic knapsack problem with conflict graphs. Sustainability, 9(2), 1\u201310.","journal-title":"Sustainability"},{"issue":"9","key":"3290_CR16","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. Information Processing Society of Japan Journal, 43(9), 2864\u20132870.","journal-title":"Information Processing Society of Japan Journal"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-019-03290-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-019-03290-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-019-03290-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,13]],"date-time":"2021-02-13T20:41:48Z","timestamp":1613248908000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-019-03290-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,17]]},"references-count":16,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["3290"],"URL":"https:\/\/doi.org\/10.1007\/s10479-019-03290-3","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,7,17]]},"assertion":[{"value":"17 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}