{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T18:42:30Z","timestamp":1773081750522,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2005,10,18]],"date-time":"2005-10-18T00:00:00Z","timestamp":1129593600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Applic"],"published-print":{"date-parts":[[2006,3]]},"DOI":"10.1007\/s10589-005-3057-0","type":"journal-article","created":{"date-parts":[[2005,11,21]],"date-time":"2005-11-21T12:24:18Z","timestamp":1132575858000},"page":"271-285","source":"Crossref","is-referenced-by-count":60,"title":["A Reactive Local Search-Based Algorithm for the Multiple-Choice Multi-Dimensional Knapsack Problem"],"prefix":"10.1007","volume":"33","author":[{"given":"M.","family":"Hifi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Michrafy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Sbihi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,10,18]]},"reference":[{"key":"3057_CR1","doi-asserted-by":"crossref","first-page":"1130","DOI":"10.1287\/opre.28.5.1130","volume":"28","author":"E. Balas","year":"1980","unstructured":"E. Balas and E. Zemel, \u201cAn algorithm for large zero-one knapsack problem,\u201d Operations Research, vol. 28, pp. 1130\u20131154, 1980.","journal-title":"Operations Research"},{"key":"3057_CR2","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1023\/A:1009642405419","volume":"4","author":"P. Chu","year":"1998","unstructured":"P. Chu and J.E. Beasley, \u201cA genetic algorithm for the multidimensional knapsack problem,\u201d Journal of Heuristics, vol. 4, pp. 63\u201386, 1998.","journal-title":"Journal of Heuristics"},{"key":"3057_CR3","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1016\/0377-2217(95)00159-X","volume":"94","author":"J.E. Beasley","year":"1996","unstructured":"J.E. Beasley and P.C. Chu, \u201cA genetic algorithm for the set covering problem,\u201d Europ. J. Opl. Res, vol. 94, pp. 392\u2013404, 1996.","journal-title":"Europ. J. Opl. Res"},{"key":"3057_CR4","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF02241754","volume":"28","author":"D. Fayard","year":"1982","unstructured":"D. Fayard and G. Plateau, \u201cAn algorithm for the solution of the 0-1 knapsack problem,\u201d Computing, vol. 28, pp. 269\u2013287, 1982.","journal-title":"Computing"},{"key":"3057_CR5","doi-asserted-by":"crossref","first-page":"1323","DOI":"10.1057\/palgrave.jors.2601796","volume":"55","author":"M. Hifi","year":"2004","unstructured":"M. Hifi, M. Michrafy and A. Sbihi, \u201cHeuristic algorithms for the multiple-choice multidimensional knapsack problem,\u201d Journal of the Operational Research Society, vol. 55, pp. 1323\u20131332, 2004.","journal-title":"Journal of the Operational Research Society"},{"key":"3057_CR6","doi-asserted-by":"crossref","unstructured":"H. Kellerer, U. Pferschy, and D. Pisinger, Knapsack Problems, Springer, 2003.","DOI":"10.1007\/978-3-540-24777-7"},{"key":"3057_CR7","unstructured":"S. Khan, K.F. Li, E.G. Manning, and MD. M. Akbar, \u201cSolving the knapsack problem for adaptive multimedia systems,\u201d Studia Informatica, an International Journal, Special Issue on Cutting, Packing and Knapsacking Problems, vol. 2, no. 1, pp. 154\u2013174, 2002."},{"key":"3057_CR8","unstructured":"S. Khan, \u201cQuality adaptation in a multi-session adaptive multimedia system: Model and architecture,\u201d PhD Thesis, Department of Electronical and Computer Engineering, Uiversity of Victoria, May 1998."},{"key":"3057_CR9","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/0377-2217(92)90335-7","volume":"60","author":"H. Luss","year":"1992","unstructured":"H. Luss, \u201cMinmax resource allocation problems: Optimization and parametric analysis,\u201d European Journal of Operational Research, vol. 60, pp. 76\u201386, 1992.","journal-title":"European Journal of Operational Research"},{"key":"3057_CR10","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1287\/mnsc.45.3.414","volume":"45","author":"S. Martello","year":"1999","unstructured":"S. Martello, D. Pisinger, and P. Toth, \u201cDynamic programming and strong bounds for the 0-1 knapsack problem,\u201d Management Science, vol. 45, pp. 414\u2013424, 1999.","journal-title":"Management Science"},{"issue":"3","key":"3057_CR11","first-page":"582","volume":"80","author":"M. Moser","year":"1997","unstructured":"M. Moser, D.P. Jokanovi\u0107, and N. Shiratori, \u201cAn algorithm for the multidimesional multiple-choice knapsack problem,\u201d IEECE Transactions on Fundamentals of Electronics, vol. 80, no. 3, pp. 582\u2013589, 1997.","journal-title":"IEECE Transactions on Fundamentals of Electronics"},{"key":"3057_CR12","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1016\/0377-2217(89)90387-1","volume":"41","author":"J.S. Pang","year":"1989","unstructured":"J.S. Pang and C.S. Yu, \u201cA min-max resource allocation problem with substitutions,\u201d European Journal of Operational Research, vol. 41, pp. 218\u2013223, 1989.","journal-title":"European Journal of Operational Research"},{"key":"3057_CR13","doi-asserted-by":"crossref","first-page":"758","DOI":"10.1287\/opre.45.5.758","volume":"45","author":"D. Pisinger","year":"1997","unstructured":"D. Pisinger, \u201cA minimal algorithm for the 0-1 knapsack problem,\u201d Operations Research, vol. 45, pp. 758\u2013767, 1997.","journal-title":"Operations Research"},{"key":"3057_CR14","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1016\/0377-2217(95)00015-I","volume":"83","author":"D. Pisinger","year":"1995","unstructured":"D. Pisinger, \u201cA minimal algorithm for the Multiple-choice Knapsack Problem,\u201d European Journal of Operational Research, vol. 83, pp. 394\u2013410, 1995.","journal-title":"European Journal of Operational Research"},{"key":"3057_CR15","unstructured":"J. Richardson, M. Palmer, G. Liepins, and M. Hilliard, \u201cSome guidelines for genetic algorithms with penalty functions,\u201d in Proceedings of the Third International Conference on Genetic Algorithms, Schaffer J (Eds.), Maurgan Kaufmann, 1989 pp. 191\u2013197."},{"key":"3057_CR16","doi-asserted-by":"crossref","first-page":"1417","DOI":"10.1287\/mnsc.21.12.1417","volume":"21","author":"Y. Toyoda","year":"1975","unstructured":"Y. Toyoda, \u201cA simplified algorithm for obtaining approximate solution to zero-one programming problems,\u201d Management Science, vol. 21, pp. 1417\u20131427, 1975.","journal-title":"Management Science"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-005-3057-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-005-3057-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-005-3057-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T02:19:17Z","timestamp":1586571557000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-005-3057-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,10,18]]},"references-count":16,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2006,3]]}},"alternative-id":["3057"],"URL":"https:\/\/doi.org\/10.1007\/s10589-005-3057-0","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,10,18]]}}}