{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T08:13:24Z","timestamp":1769069604763,"version":"3.49.0"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"21","license":[{"start":{"date-parts":[[2021,8,23]],"date-time":"2021-08-23T00:00:00Z","timestamp":1629676800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,8,23]],"date-time":"2021-08-23T00:00:00Z","timestamp":1629676800000},"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":["Soft Comput"],"published-print":{"date-parts":[[2021,11]]},"DOI":"10.1007\/s00500-021-06091-8","type":"journal-article","created":{"date-parts":[[2021,8,23]],"date-time":"2021-08-23T15:06:03Z","timestamp":1629731163000},"page":"13617-13639","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["An iterative rounding strategy-based algorithm for the set-union knapsack problem"],"prefix":"10.1007","volume":"25","author":[{"given":"Isma","family":"Dahmani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Meriem","family":"Ferroum","sequence":"additional","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":[[2021,8,23]]},"reference":[{"key":"6091_CR1","doi-asserted-by":"publisher","first-page":"4221","DOI":"10.1007\/s00500-017-2744-y","volume":"22","author":"M Abdel-Basset","year":"2018","unstructured":"Abdel-Basset M, El-Shahat D, El-Henawy I, Sangaiah AK (2018) A modified flower pollination algorithm for the multidimensional knapsack problem: human-centric decision making. Soft Computing 22:4221\u20134239","journal-title":"Soft Comput"},{"key":"6091_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/s12351-019-00463-7","author":"T Al-Douri","year":"2019","unstructured":"Al-Douri T, Hifi M, Zissimopoulos V (2019) An iterative algorithm for the max-min knapsack problem with multiple scenarios. Operational Research - An International Journal. https:\/\/doi.org\/10.1007\/s12351-019-00463-7","journal-title":"Oper Res Int J"},{"key":"6091_CR3","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/j.dam.2013.12.015","volume":"169","author":"A Arulselvan","year":"2014","unstructured":"Arulselvan A (2014) A note on the set union knapsack problem. Discrete Applied Mathematics 169:214\u2013218","journal-title":"Discret Appl Math"},{"key":"6091_CR4","doi-asserted-by":"publisher","first-page":"2555","DOI":"10.1007\/s12351-018-0427-9","volume":"20","author":"A Baykasoglu","year":"2020","unstructured":"Baykasoglu A, Ozsoydan FB, Senol ME (2020) Weighted superposition attraction algorithm for binary optimization problems. Operational Research 20:2555\u20132581","journal-title":"Oper Res Int J"},{"issue":"4","key":"6091_CR5","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1287\/mnsc.48.4.550.208","volume":"48","author":"D Bertsimas","year":"2002","unstructured":"Bertsimas D, Demir R (2002) An approximate dynamic programming approach to multidimensional knapsack problems. Management Science 48(4), 550\u2013565","journal-title":"Manage Sci"},{"issue":"2","key":"6091_CR6","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1287\/opre.5.2.266","volume":"5","author":"GB Dantzig","year":"1957","unstructured":"Dantzig GB (1957) Discrete-variable extremum problem. Operations Research 5(2), 266\u2013288","journal-title":"Oper Res"},{"issue":"5","key":"6091_CR7","doi-asserted-by":"publisher","first-page":"1602","DOI":"10.1016\/j.cor.2008.03.003","volume":"36","author":"K Fleszar","year":"2009","unstructured":"Fleszar K, Hindi S (2009) Fast, effective heuristics for the 0\u20131 multi-dimensional knapsack problem. Computers & Operations Research 36(5), 1602\u20131607","journal-title":"Comput Oper Res"},{"key":"6091_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2020.105586","author":"I Golcuk","year":"2020","unstructured":"Golcuk I, Ozsoydan FB (2020) Evolutionary and adaptive inheritance enhanced Grey Wolf Optimization algorithm for binary domains. Knowledge-Based Syst, doi: 10.1016\/j.knosys.2020.105586.","journal-title":"Knowledge-Based Syst"},{"issue":"6","key":"6091_CR9","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1002\/1520-6750(199410)41:6<833::AID-NAV3220410611>3.0.CO;2-Q","volume":"41","author":"O Goldschmidt","year":"1994","unstructured":"Goldschmidt O, Nehme D, Yu G (1994) Note: On the set-union knapsack problem. Naval Research Logistics 41(6), 833\u2013842","journal-title":"Nav Res Logist"},{"key":"6091_CR10","unstructured":"Goldschmidt O, Nehme D, Yu G (1992) On a generalization of the knapsack problem with applications to flexible manufacturing systems and database partitioning. Working Paper No. 92\/93-3-7, Graduate School of Business, University of Texas at Austin"},{"key":"6091_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2018.07.045","author":"Y He","year":"2021","unstructured":"He Y, Wang X (2021) Group theory-based optimization algorithm for solving knapsack problems. Knowledge-Based Syst, doi: 10.1016\/j.knosys.2018.07.045.","journal-title":"Knowledge-Based Syst"},{"key":"6091_CR12","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.future.2017.05.044","volume":"78","author":"Y He","year":"2018","unstructured":"He Y, Xie H, Wong T-L, Wang X (2018) A novel binary artificial bee colony algorithm for the set-union knapsack problem. Future Generation Computer Systems 78:77\u201386","journal-title":"Futur Gener Comput Syst"},{"issue":"8","key":"6091_CR13","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":"Eng Optim"},{"key":"6091_CR14","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":"J Oper Res Soc"},{"issue":"12","key":"6091_CR15","doi-asserted-by":"publisher","first-page":"1619","DOI":"10.1080\/0305215X.2014.982631","volume":"47","author":"M Hifi","year":"2015","unstructured":"Hifi 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":"Eng Optim"},{"key":"6091_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack problems","author":"H Kellerer","year":"2004","unstructured":"Kellerer H, Perschy U, Pisinger D (2004) Knapsack problems. Springer, Berlin"},{"key":"6091_CR17","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0020-0190(99)00031-9","volume":"70","author":"S Khuller","year":"1999","unstructured":"Khuller S, Moss A, Naor J (1999) The budgeted maximum coverage problem. Information Processing Letters 70:39\u201345","journal-title":"Inf Process Lett"},{"key":"6091_CR18","doi-asserted-by":"publisher","first-page":"2567","DOI":"10.1007\/s00500-017-2511-0","volume":"22","author":"LFM L\u00f3pez","year":"2018","unstructured":"L\u00f3pez LFM, Blas NG, Albert AA (2018) Multidimensional knapsack problem optimization using a binary particle swarm model with genetic operations. Soft Computing 22:2567\u20132582","journal-title":"Soft Comput"},{"key":"6091_CR19","volume-title":"Knapsack problems: algorithms and computer implementations","author":"S Martello","year":"1990","unstructured":"Martello S, Toth P (1990) Knapsack problems: Algorithms and computer implementations. John Wiley & Sons Ltd., Chichester"},{"issue":"5","key":"6091_CR20","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1109\/TIT.1978.1055927","volume":"24","author":"R Merkle","year":"1978","unstructured":"Merkle R, Hellman M (1978) Hiding information and signatures in trapdoor knapsacks. IEEE Transactions on Information Theory 24(5), 525\u2013530","journal-title":"IEEE Trans Inf Theory"},{"key":"6091_CR21","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.cie.2019.07.007","volume":"136","author":"FB Ozsoydan","year":"2019","unstructured":"Ozsoydan FB (2019) Artificial search agents with cognitive intelligence for binary optimization problems. Computers & Industrial Engineering 136:18\u201330","journal-title":"Comput Ind Eng"},{"key":"6091_CR22","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1016\/j.future.2018.08.002","volume":"93","author":"FB Ozsoydan","year":"2019","unstructured":"Ozsoydan FB, Baykasoglu A (2019) A swarm intelligence-based algorithm for the set-union knapsack problem. Future Generation Computer Systems 93:560\u2013569","journal-title":"Futur Gener Comput Syst"},{"key":"6091_CR23","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":"Proc Soc Behav Sci"},{"key":"6091_CR24","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/BF01299390","volume":"3","author":"AB Poore","year":"1994","unstructured":"Poore AB (1994) Multidimensional assignment formulation of data association problems arising from multitarget and multisensor tracking. Computational Optimization and Applications 3:27\u201357","journal-title":"Comput Optim Appl"},{"key":"6091_CR25","doi-asserted-by":"publisher","first-page":"1005","DOI":"10.1016\/j.future.2019.07.062","volume":"101","author":"Z Wei","year":"2019","unstructured":"Wei Z, Hao J-K (2019) Iterated two-phase local search for the set-union knapsack problem. Future Generation Computer Systems 101:1005\u20131017","journal-title":"Futur Gener Comput Syst"},{"key":"6091_CR26","doi-asserted-by":"publisher","first-page":"1883","DOI":"10.1007\/s00500-019-04021-3","volume":"24","author":"C Wu","year":"2020","unstructured":"Wu C, He Y (2020) Solving the set-union knapsack problem by a novel hybrid Jaya algorithm. Soft Computing 24:1883\u20131902","journal-title":"Soft Comput"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-021-06091-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-021-06091-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-021-06091-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,13]],"date-time":"2021-10-13T04:06:07Z","timestamp":1634097967000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-021-06091-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,23]]},"references-count":26,"journal-issue":{"issue":"21","published-print":{"date-parts":[[2021,11]]}},"alternative-id":["6091"],"URL":"https:\/\/doi.org\/10.1007\/s00500-021-06091-8","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8,23]]},"assertion":[{"value":"7 June 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 August 2021","order":2,"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 that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}