{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T04:28:07Z","timestamp":1743049687391,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662490136"},{"type":"electronic","value":"9783662490143"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-49014-3_46","type":"book-chapter","created":{"date-parts":[[2015,12,23]],"date-time":"2015-12-23T09:41:36Z","timestamp":1450863696000},"page":"513-522","source":"Crossref","is-referenced-by-count":5,"title":["A Stochastic Local Search Heuristic for the Multidimensional Multiple-choice Knapsack Problem"],"prefix":"10.1007","author":[{"given":"Youxin","family":"Xia","sequence":"first","affiliation":[]},{"given":"Chao","family":"Gao","sequence":"additional","affiliation":[]},{"given":"JinLong","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,24]]},"reference":[{"key":"46_CR1","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/S0304-0208(08)73237-7","volume":"132","author":"S Martello","year":"1987","unstructured":"Martello, S., Toth, P.: Algorithms for knapsack problems. North-Holland Math. Stud. 132, 213\u2013257 (1987)","journal-title":"North-Holland Math. Stud."},{"issue":"3","key":"46_CR2","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1287\/opre.27.3.503","volume":"27","author":"P Sinha","year":"1979","unstructured":"Sinha, P., Zoltners, A.A.: The multiple-choice knapsack problem. Oper. Res. 27(3), 503\u2013515 (1979)","journal-title":"Oper. Res."},{"issue":"1","key":"46_CR3","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1023\/A:1009642405419","volume":"4","author":"PC Chu","year":"1998","unstructured":"Chu, P.C., Beasley, J.E.: A genetic algorithm for the multidimensional knapsack problem. J. Heuristics 4(1), 63\u201386 (1998)","journal-title":"J. Heuristics"},{"issue":"5","key":"46_CR4","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1111\/j.1475-3995.2005.00523.x","volume":"12","author":"C Basnet","year":"2005","unstructured":"Basnet, C., Wilson, J.: Heuristics for determining the number of warehouses for storing non-compatible products. Int. Trans. Oper. Res. 12(5), 527\u2013538 (2005)","journal-title":"Int. Trans. Oper. Res."},{"doi-asserted-by":"crossref","unstructured":"Ykman-Couvreur, C., Nollet, V., Catthoor, F., Corporaal, H.: Fast multi-dimension multi-choice knapsack heuristic for MP-SoC run-time management. In: International Symposium on System-on-Chip, pp. 1\u20134. IEEE (2006)","key":"46_CR5","DOI":"10.1109\/ISSOC.2006.321966"},{"doi-asserted-by":"crossref","unstructured":"Shojaei, H., Wu, T.H., Davoodi, A., Basten, T.: A pareto-algebraic framework for signal power optimization in global routing. In: Proceedings of the 16th ACM\/IEEE International Symposium on Low Power Electronics and Design, pp. 407\u2013412. ACM (2010)","key":"46_CR6","DOI":"10.1145\/1840845.1840935"},{"issue":"1","key":"46_CR7","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1145\/1232722.1232728","volume":"1","author":"T Yu","year":"2007","unstructured":"Yu, T., Zhang, Y., Lin, K.J.: Efficient algorithms for web services selection with end-to-end QoS constraints. ACM Trans. Web (TWEB) 1(1), 6 (2007)","journal-title":"ACM Trans. Web (TWEB)"},{"issue":"3","key":"46_CR8","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1016\/S0377-2217(99)00451-8","volume":"129","author":"D Pisinger","year":"2001","unstructured":"Pisinger, D.: Budgeting with bounded multiple-choice constraints. Eur. J. Oper. Res. 129(3), 471\u2013480 (2001)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"46_CR9","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/S0305-0548(02)00192-2","volume":"31","author":"V Li","year":"2004","unstructured":"Li, V., Curry, G.L., Boyd, E.A.: Towards the real time solution of strike force asset allocation problems. Comput. Oper. Res. 31(2), 273\u2013291 (2004)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"46_CR10","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1016\/j.cie.2010.12.001","volume":"60","author":"T Ghasemi","year":"2011","unstructured":"Ghasemi, T., Razzazi, M.: Development of core to solve the multidimensional multiple-choice knapsack problem. Comput. Indus. Eng. 60(2), 349\u2013360 (2011)","journal-title":"Comput. Indus. Eng."},{"unstructured":"Khan, S.: Quality adaptation in a multi-session adaptive multimedia system: model and architecture. Ph.D. thesis, Department of Electronical and Computer Engineering, University of Victoria, Canada (1998)","key":"46_CR11"},{"issue":"4","key":"46_CR12","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s10878-006-9035-3","volume":"13","author":"A Sbihi","year":"2007","unstructured":"Sbihi, A.: A best first search exact algorithm for the multiple-choice multidimensional knapsack problem. J. Comb. Optim. 13(4), 337\u2013351 (2007)","journal-title":"J. Comb. Optim."},{"issue":"3","key":"46_CR13","first-page":"582","volume":"80","author":"M Moser","year":"1997","unstructured":"Moser, M., Jokanovic, D.P., Shiratori, N.: An algorithm for the multidimensional multiple-choice knapsack problem. IEICE Trans. Fundam. Electr. Commun. Comput. Sci. 80(3), 582\u2013589 (1997)","journal-title":"IEICE Trans. Fundam. Electr. Commun. Comput. Sci."},{"key":"46_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1007\/3-540-45718-6_71","volume-title":"Computational Science - ICCS 2001","author":"MM Akbar","year":"2001","unstructured":"Akbar, M.M., Manning, E.G., Shoja, G.C., Khan, S.: Heuristic solutions for the multiple-choice multi-dimension knapsack problem. In: Alexandrov, V.N., Dongarra, J., Juliano, B.A., Renner, R.S., Tan, C.J.K. (eds.) ICCS-ComputSci 2001. LNCS, vol. 2074, pp. 659\u2013668. Springer, Heidelberg (2001)"},{"issue":"1","key":"46_CR15","first-page":"157","volume":"2","author":"S Khan","year":"2002","unstructured":"Khan, S., Li, K.F., Manning, E.G., Akbar, M.M.: Solving the knapsack problem for adaptive multimedia systems. Stud. Inform. Univ. 2(1), 157\u2013178 (2002)","journal-title":"Stud. Inform. Univ."},{"issue":"12","key":"46_CR16","doi-asserted-by":"publisher","first-page":"1323","DOI":"10.1057\/palgrave.jors.2601796","volume":"55","author":"M Hifi","year":"2004","unstructured":"Hifi, M., Michrafy, M., Sbihi, A.: Heuristic algorithms for the multiple-choice multidimensional knapsack problem. J. Oper. Res. Soc. 55(12), 1323\u20131332 (2004)","journal-title":"J. Oper. Res. Soc."},{"issue":"2\u20133","key":"46_CR17","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/s10589-005-3057-0","volume":"33","author":"M Hifi","year":"2006","unstructured":"Hifi, M., Michrafy, M., Sbihi, A.: A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem. Comput. Optim. Appl. 33(2\u20133), 271\u2013285 (2006)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"46_CR18","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/s10589-008-9184-7","volume":"46","author":"N Cherfi","year":"2010","unstructured":"Cherfi, N., Hifi, M.: A column generation method for the multiple-choice multi-dimensional knapsack problem. Comput. Optim. Appl. 46(1), 51\u201373 (2010)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"46_CR19","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1504\/IJOR.2009.024531","volume":"5","author":"N Cherfi","year":"2009","unstructured":"Cherfi, N., Hifi, M.: Hybrid algorithms for the multiple-choice multi-dimensional knapsack problem. Int. J. Oper. Res. 5(1), 89\u2013109 (2009)","journal-title":"Int. J. Oper. Res."},{"key":"46_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/978-3-642-15461-4_27","volume-title":"Swarm Intelligence","author":"S Iqbal","year":"2010","unstructured":"Iqbal, S., Bari, M.F., Rahman, M.S.: Solving the multi-dimensional multi-choice knapsack problem with the help of ants. In: Dorigo, M., et al. (eds.) ANTS 2010. LNCS, vol. 6234, pp. 312\u2013323. Springer, Heidelberg (2010)"},{"doi-asserted-by":"crossref","unstructured":"Ren, Z., Feng, Z.: An ant colony optimization approach to the multiple-choice multidimensional knapsack problem. In: Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation, pp. 281\u2013288. ACM (2010)","key":"46_CR21","DOI":"10.1145\/1830483.1830533"},{"doi-asserted-by":"crossref","unstructured":"Shojaei, H., Ghamarian, A., Basten, T., Geilen, M., Stuijk, S., Hoes, R.: A parameterized compositional multi-dimensional multiple-choice knapsack heuristic for cmp run-time management. In: Proceedings of the 46th Annual Design Automation Conference, pp. 917\u2013922. ACM (2009)","key":"46_CR22","DOI":"10.1145\/1629911.1630147"},{"key":"46_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-642-04918-7_6","volume-title":"Hybrid Metaheuristics","author":"S Hanafi","year":"2009","unstructured":"Hanafi, S., Mansi, R., Wilbaut, C.: Iterative relaxation-based heuristics for the multiple-choice multidimensional knapsack problem. In: Blesa, M.J., Blum, C., Di Gaspero, L., Roli, A., Sampels, M., Schaerf, A. (eds.) HM 2009. LNCS, vol. 5818, pp. 73\u201383. Springer, Heidelberg (2009)"},{"issue":"1","key":"46_CR24","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.cor.2010.12.016","volume":"39","author":"I Cr\u00e9vits","year":"2012","unstructured":"Cr\u00e9vits, I., Hanafi, S., Mansi, R., Wilbaut, C.: Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem. Comput. Oper. Res. 39(1), 32\u201341 (2012)","journal-title":"Comput. Oper. Res."},{"issue":"8","key":"46_CR25","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1080\/0305215X.2012.717072","volume":"45","author":"R Mansi","year":"2013","unstructured":"Mansi, R., Alves, C., Val\u00e9rio de Carvalho, J., Hanafi, S.: A hybrid heuristic for the multiple choice multidimensional knapsack problem. Eng. Optim. 45(8), 983\u20131004 (2013)","journal-title":"Eng. Optim."},{"issue":"2","key":"46_CR26","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/j.ejor.2014.05.025","volume":"239","author":"Y Chen","year":"2014","unstructured":"Chen, Y., Hao, J.K.: A \u201creduce and solve\u201d approach for the multiple-choice multidimensional knapsack problem. Eur. J. Oper. Res. 239(2), 313\u2013322 (2014)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"46_CR27","doi-asserted-by":"publisher","first-page":"51:1","DOI":"10.1145\/2541012.2541014","volume":"18","author":"H Shojaei","year":"2013","unstructured":"Shojaei, H., Basten, T., Geilen, M., Davoodi, A.: A fast and scalable multidimensional multiple-choice knapsack heuristic. ACM Trans. Des. Autom. Electron. Syst. 18(4), 51:1\u201351:32 (2013)","journal-title":"ACM Trans. Des. Autom. Electron. Syst."},{"doi-asserted-by":"crossref","unstructured":"Htiouech, S., Bouamama, S., Attia, R.: Using surrogate information to solve the multidimensional multi-choice knapsack problem. In: 2013 IEEE Congress on Evolutionary Computation (CEC), pp. 2102\u20132107. IEEE (2013)","key":"46_CR28","DOI":"10.1109\/CEC.2013.6557817"},{"issue":"12","key":"46_CR29","doi-asserted-by":"publisher","first-page":"1417","DOI":"10.1287\/mnsc.21.12.1417","volume":"21","author":"Y Toyoda","year":"1975","unstructured":"Toyoda, Y.: A simplified algorithm for obtaining approximate solutions to zero-one programming problems. Manag. Sci. 21(12), 1417\u20131427 (1975)","journal-title":"Manag. Sci."},{"issue":"4","key":"46_CR30","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1504\/IJOR.2007.014176","volume":"2","author":"CS Hiremath","year":"2007","unstructured":"Hiremath, C.S., Hill, R.R.: New greedy heuristics for the multiple-choice multi-dimensional knapsack problem. Int. J. Oper. Res. 2(4), 495\u2013512 (2007)","journal-title":"Int. J. Oper. Res."}],"container-title":["Communications in Computer and Information Science","Bio-Inspired Computing -- Theories and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49014-3_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T22:57:31Z","timestamp":1559343451000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49014-3_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662490136","9783662490143"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49014-3_46","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2015]]}}}