{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T18:33:05Z","timestamp":1774377185161,"version":"3.50.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T00:00:00Z","timestamp":1552089600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T00:00:00Z","timestamp":1552089600000},"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":["Oper Res Int J"],"published-print":{"date-parts":[[2021,6]]},"DOI":"10.1007\/s12351-019-00463-7","type":"journal-article","created":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T08:57:55Z","timestamp":1552121875000},"page":"1355-1392","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["An iterative algorithm for the Max-Min knapsack problem with multiple scenarios"],"prefix":"10.1007","volume":"21","author":[{"given":"Thekra","family":"Al-douri","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"}]},{"given":"Vassilis","family":"Zissimopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,3,9]]},"reference":[{"key":"463_CR1","doi-asserted-by":"crossref","unstructured":"Al-douri T, Hifi M (2016) A diversified method for the multi-scenarios max-min knapsack problem. In: Proceedings of IEEE, international conference on control, decision and information technologies (CoDIT16), pp 355\u2013359. https:\/\/doi.org\/10.1109\/CoDIT.2016.7593588","DOI":"10.1109\/CoDIT.2016.7593588"},{"key":"463_CR2","doi-asserted-by":"crossref","unstructured":"Al-douri T, Hifi M (2018) A two-stage hybrid method for the multi-scenarios max-min knapsack problem. Int J Intell Eng Inf, To appear","DOI":"10.1504\/IJIEI.2018.10012068"},{"issue":"1","key":"463_CR3","first-page":"1","volume":"40","author":"T Al-douri","year":"2018","unstructured":"Al-douri T, Hifi M (2018a) A hybrid reactive search for solving the max-min knapsack problem with multi-scenarios. Int J Comput Appl 40(1):1\u201313","journal-title":"Int J Comput Appl"},{"key":"463_CR4","unstructured":"Al-douri T, Hifi M, Saleh S (2015) A fast algorithm for solving the max-min knapsack problem with two scenarios. In: Proceedings of IEEE, international conference on computers & industrial engineering (CIE45), pp 672\u2013680"},{"key":"463_CR5","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1287\/opre.27.2.341","volume":"9","author":"JR Brown","year":"1979","unstructured":"Brown JR (1979) The knapsack sharing. Oper Res 9:341\u2013355","journal-title":"Oper Res"},{"key":"463_CR6","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/BF01586926","volume":"51","author":"JR Brown","year":"1991","unstructured":"Brown JR (1991) Solving knapsack sharing with general tradeoff functions. Math Program 51:55\u201373","journal-title":"Math Program"},{"issue":"2","key":"463_CR7","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. Oper Res 5(2):266\u2013288","journal-title":"Oper Res"},{"key":"463_CR8","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0167-6377(89)90002-3","volume":"8","author":"TA Feo","year":"1989","unstructured":"Feo TA, Resende MGC (1989) A probabilistic heuristic for a computationally difficult set covering problem. Oper Res Lett 8:67\u201371","journal-title":"Oper Res Lett"},{"issue":"2","key":"463_CR9","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1016\/j.ejor.2004.09.036","volume":"171","author":"M Fujimoto","year":"2006","unstructured":"Fujimoto M, Yamada T (2006) An exact algorithm for the knapsack sharing problem with common items. Eur J Oper Res 171(2):693\u2013707","journal-title":"Eur J Oper Res"},{"issue":"1","key":"463_CR10","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s11047-014-9470-5","volume":"15","author":"B Haddar","year":"2016","unstructured":"Haddar B, Khemakhem M, Rhimi H, Chabchoub H (2016) A quantum particle swarm optimization for the 0\u20131 generalized knapsack sharing problem. Nat Comput 15(1):153\u2013164","journal-title":"Nat Comput"},{"key":"463_CR11","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1111\/j.1475-3995.2011.00836.x","volume":"19","author":"S Hanafi","year":"2012","unstructured":"Hanafi S, Mansi R, Wilbaut C, Freville A (2012) Hybrid approaches for the two-scenario max-min knapsack problem. Int Trans Oper Res 19:353\u2013378","journal-title":"Int Trans Oper Res"},{"issue":"6","key":"463_CR12","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":"3","key":"463_CR13","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1016\/j.ejor.2016.02.009","volume":"252","author":"M Hifi","year":"2016","unstructured":"Hifi M, Wu L (2016) An exact decomposition algorithm for the generalized knapsack sharing problem. Eur J Oper Res 252(3):761\u2013774","journal-title":"Eur J Oper Res"},{"issue":"7","key":"463_CR14","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1057\/palgrave.jors.2600798","volume":"48","author":"SI Gass","year":"1997","unstructured":"Gass SI, Harris CM (1997) Encyclopedia of operations research and management science. J Oper Res Soc 48(7):759\u2013760","journal-title":"J Oper Res Soc"},{"issue":"2","key":"463_CR15","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1145\/321812.321823","volume":"21","author":"E Horowitz","year":"1994","unstructured":"Horowitz E, Sahni S (1994) Computing partitions with applications to the knapsack problem. J Assoc Comput Mach 21(2):277\u2013292","journal-title":"J Assoc Comput Mach"},{"key":"463_CR16","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1023\/A:1009821323279","volume":"3","author":"H Iida","year":"1999","unstructured":"Iida H (1999) A note on the max-min 0\u20131 knapsack problem. J Comb Optim 3:89\u201394","journal-title":"J Comb Optim"},{"key":"463_CR17","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":"463_CR18","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1287\/ijoc.11.1.44","volume":"11","author":"M Laguna","year":"1999","unstructured":"Laguna M, Marti R (1999) GRASP and path relinking for 2-layer straight line crossing minimization. INFORMS J Comput 11:44\u201352","journal-title":"INFORMS J Comput"},{"issue":"5","key":"463_CR19","doi-asserted-by":"publisher","first-page":"1078","DOI":"10.1080\/10556788.2016.1240795","volume":"32","author":"H Mhalla","year":"2017","unstructured":"Mhalla H (2017) An exact constructive algorithm for the knapsack sharing problem. Optim Methods Softw 32(5):1078\u20131094","journal-title":"Optim Methods Softw"},{"key":"463_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2015\/439609","volume":"439609","author":"T Pinto","year":"2015","unstructured":"Pinto T, Alves C, Mansi R, Valerio J (2015) Solving the multiple-scenario max-min knapsack problem exactly with column generation and branch-and-bound. Math Prob Eng 439609:1\u201311. https:\/\/doi.org\/10.1155\/2015\/439609","journal-title":"Math Prob Eng"},{"issue":"3","key":"463_CR21","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1016\/j.cor.2008.05.011","volume":"37","author":"MGC Resende","year":"2010","unstructured":"Resende MGC, Mart R, Gallegoc M, Duarte A (2010) GRASP and path relinking for the max-min diversity problem. Comput Oper Res 37(3):498\u2013508","journal-title":"Comput Oper Res"},{"issue":"9","key":"463_CR22","doi-asserted-by":"publisher","first-page":"1988","DOI":"10.1016\/j.cor.2011.09.012","volume":"39","author":"X Song","year":"2012","unstructured":"Song X, Lewis R, Thompson J, Wu Y (2012) An incomplete m-exchange algorithm for solving the large-scale multi-scenario knapsack problem. Comput Oper Res 39(9):1988\u20132000","journal-title":"Comput Oper Res"},{"key":"463_CR23","volume-title":"Multiple criteria optimization: theory, computations and application","author":"R Steuer","year":"1986","unstructured":"Steuer R (1986) Multiple criteria optimization: theory, computations and application. Wiley, New York"},{"key":"463_CR24","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1287\/opre.36.2.359","volume":"36","author":"CS Tang","year":"1988","unstructured":"Tang CS (1988) A max-min allocation problem: its solutions and applications. Oper Res 36:359\u2013367","journal-title":"Oper Res"},{"issue":"6","key":"463_CR25","doi-asserted-by":"publisher","first-page":"2034","DOI":"10.1016\/j.cor.2006.10.002","volume":"35","author":"F Taniguchi","year":"2008","unstructured":"Taniguchi F, Yamada T, Kataoka S (2008) Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem. Comput Oper Res 35(6):2034\u20132048","journal-title":"Comput Oper Res"},{"key":"463_CR26","doi-asserted-by":"publisher","first-page":"779","DOI":"10.1080\/00207160701690433","volume":"86","author":"F Taniguchi","year":"2009","unstructured":"Taniguchi F, Yamada T, Kataoko S (2009) A virtual pegging approach to the max-min optimization of the bi-criteria knapsack problem. Int J Comput Math 86:779\u2013793","journal-title":"Int J Comput Math"},{"key":"463_CR27","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1016\/S0305-0548(97)00009-9","volume":"24","author":"T Yamada","year":"1997","unstructured":"Yamada T, Futakawa M (1997) Heuristic and reduction algorithms for the knapsack sharing problem. Comput Oper Res 24:961\u2013967","journal-title":"Comput Oper Res"},{"issue":"1","key":"463_CR28","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0377-2217(97)00165-3","volume":"106","author":"T Yamada","year":"1998","unstructured":"Yamada T, Futakawa M, Kataoka S (1998) Some exact algorithms for the knapsack sharing problem. Eur J Oper Res 106(1):177\u2013183","journal-title":"Eur J Oper Res"},{"issue":"2","key":"463_CR29","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1287\/opre.44.2.407","volume":"44","author":"G Yu","year":"1996","unstructured":"Yu G (1996) On the max-min 0\u20131 knapsack problem with robust optimization applications. Oper Res 44(2):407\u2013415","journal-title":"Oper Res"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-019-00463-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12351-019-00463-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-019-00463-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,21]],"date-time":"2021-05-21T09:29:46Z","timestamp":1621589386000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12351-019-00463-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3,9]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,6]]}},"alternative-id":["463"],"URL":"https:\/\/doi.org\/10.1007\/s12351-019-00463-7","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,3,9]]},"assertion":[{"value":"13 May 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 October 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 January 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 March 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}