{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T14:17:14Z","timestamp":1760710634851,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030801182"},{"type":"electronic","value":"9783030801199"}],"license":[{"start":{"date-parts":[[2021,7,13]],"date-time":"2021-07-13T00:00:00Z","timestamp":1626134400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,7,13]],"date-time":"2021-07-13T00:00:00Z","timestamp":1626134400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-80119-9_7","type":"book-chapter","created":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T19:14:28Z","timestamp":1626117268000},"page":"154-168","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Computational Power of a Hybrid Algorithm for Solving the Multiple Knapsack Problem with Setup"],"prefix":"10.1007","author":[{"given":"Samah","family":"Boukhari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Isma","family":"Dahmani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mhand","family":"Hifi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,7,13]]},"reference":[{"issue":"5","key":"7_CR1","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1504\/EJIE.2020.109906","volume":"14","author":"Y Adouani","year":"2020","unstructured":"Adouani, Y., Jarboui, B., Masmoudi, M.: Efficient matheuristic for the generalised multiple knapsack problem with setup. Eur. J. Ind. Eng. (EJIE) 14(5), 715\u2013741 (2020)","journal-title":"Eur. J. Ind. Eng. (EJIE)"},{"issue":"2","key":"7_CR2","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/j.ejor.2004.06.023","volume":"170","author":"U Akinc","year":"2006","unstructured":"Akinc, U.: Approximate and exact algorithms for the fixed-charge knapsack problem. Eur. J. Oper. Res. 170(2), 363\u2013375 (2006)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"7_CR3","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1016\/j.ejor.2007.07.003","volume":"190","author":"N Altay","year":"2008","unstructured":"Altay, N., Robinson, J.R., Powell, E., Bretthauer, K.M.: Exact and heuristic solution approaches for the mixed integer setup knapsack problem. Eur. J. Oper. Res. 190(3), 598\u2013609 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"113077","DOI":"10.1016\/j.eswa.2019.113077","volume":"143","author":"A Amiri","year":"2019","unstructured":"Amiri, A.: A Lagrangean based solution algorithm for the knapsack problem with setups. Expert Syst. Appl. 143, 113077 (2019). https:\/\/doi.org\/10.1016\/j.eswa.2019.113077","journal-title":"Expert Syst. Appl."},{"key":"7_CR5","doi-asserted-by":"publisher","unstructured":"Boukhari, S., Dahmani, I., Hifi, M.: Local branching strategy-based method for the knapsack problem with setup. In: Wyld, D.C., et al. (eds.) Proceedings of the 4th International Conference on Artificial Intelligence, Soft Computing And Applications, CS & IT - CSCP 2020, pp. 65\u201375 (2020). https:\/\/doi.org\/10.5121\/csit.2020.101606","DOI":"10.5121\/csit.2020.101606"},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.cor.2015.05.005","volume":"64","author":"K Chebil","year":"2015","unstructured":"Chebil, K., Khemakhem, M.: A dynamic programming algorithm for the knapsack problem with setup. Comput. Oper. Res. 64, 40\u201350 (2015)","journal-title":"Comput. Oper. Res."},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.cor.2016.11.015","volume":"80","author":"CF Della","year":"2017","unstructured":"Della, C.F., Salassa, F., Scatamacchia, R.: An exact approach for the 0\u20131 knapsack problem with setups. Comput. Oper. Res. 80, 61\u201367 (2017)","journal-title":"Comput. Oper. Res."},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Furini, F., Monaci, M., Traversi, E.: Exact algorithms for the knapsack problem with setup. Technical report, University of Paris Dauphine (2017)","DOI":"10.1016\/j.cor.2017.09.019"},{"issue":"1","key":"7_CR9","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0166-218X(93)90176-O","volume":"42","author":"M Guignard","year":"1993","unstructured":"Guignard, M.: Solving Makespan minimization problems with Lagrangean decomposition. Discrete Appl. Math. 42(1), 17\u201329 (1993)","journal-title":"Discrete Appl. Math."},{"issue":"5","key":"7_CR10","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1016\/S0305-0548(03)00019-4","volume":"31","author":"M Hifi","year":"2004","unstructured":"Hifi, M.: Exact algorithms for unconstrained three-dimensional cutting problems: a comparative study. Comput. Oper. Res. 31(5), 657\u2013674 (2004)","journal-title":"Comput. Oper. Res."},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1016\/j.cie.2016.07.021","volume":"99","author":"M Khemakhem","year":"2016","unstructured":"Khemakhem, M., Chebil, K.: A tree search based combination heuristic for the knapsack problem with setup. Comput. Ind. Eng. 99, 280\u2013286 (2016)","journal-title":"Comput. Ind. Eng."},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.cie.2019.01.010","volume":"129","author":"R Lahyani","year":"2019","unstructured":"Lahyani, R., Chebil, K., Khemakhem, M., Coelho, C.: Matheuristics for solving the multiple knapsack problem with setup. Comput. Ind. Eng. 129, 76\u201389 (2019)","journal-title":"Comput. Ind. Eng."},{"key":"7_CR13","unstructured":"McLay, L.A.: Designing Aviation Security Systems: Theory and Practice (2006)"},{"issue":"5","key":"7_CR14","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.: Hiding information and signatures in trapdoor knapsacks. IEEE Trans. Inf. Theor. 24(5), 525\u2013530 (1978)","journal-title":"IEEE Trans. Inf. Theor."},{"issue":"3","key":"7_CR15","doi-asserted-by":"publisher","first-page":"909","DOI":"10.1016\/j.ejor.2008.05.001","volume":"196","author":"S Michel","year":"2009","unstructured":"Michel, S., Perrot, N., Vanderbeck, F.: Knapsack problems with setups. Eur. J. Oper. Res. 196(3), 909\u2013918 (2009)","journal-title":"Eur. J. Oper. Res."},{"key":"7_CR16","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.: Packing problems in transportation and supply chain: new problems and trends. Proc. Soc. Behav. Sci. 111, 672\u2013681 (2014)","journal-title":"Proc. Soc. Behav. Sci."},{"key":"7_CR17","unstructured":"Yanchun, Y.: Knapsack problems with setup. Dissertation, Auburn University, USA (2006)"}],"container-title":["Lecture Notes in Networks and Systems","Intelligent Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-80119-9_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T19:15:55Z","timestamp":1626117355000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-80119-9_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,13]]},"ISBN":["9783030801182","9783030801199"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-80119-9_7","relation":{},"ISSN":["2367-3370","2367-3389"],"issn-type":[{"type":"print","value":"2367-3370"},{"type":"electronic","value":"2367-3389"}],"subject":[],"published":{"date-parts":[[2021,7,13]]},"assertion":[{"value":"13 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}