{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:19:45Z","timestamp":1761895185851,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642164927"},{"type":"electronic","value":"9783642164934"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16493-4_16","type":"book-chapter","created":{"date-parts":[[2010,10,14]],"date-time":"2010-10-14T07:47:57Z","timestamp":1287042477000},"page":"148-157","source":"Crossref","is-referenced-by-count":8,"title":["A Novel Multi-Population Genetic Algorithm for Multiple-Choice Multidimensional Knapsack Problems"],"prefix":"10.1007","author":[{"given":"Qian","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenjian","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"12","key":"16_CR1","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. Journal of the Operational Research Society\u00a055(12), 1323\u20131332 (2004)","journal-title":"Journal of the Operational Research Society"},{"issue":"1","key":"16_CR2","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1016\/j.cor.2009.04.006","volume":"37","author":"B. Han","year":"2010","unstructured":"Han, B., Leblet, J., Simon, G.: Hard Multidimensional Multiple Choice Knapsack Problem, an Empirical Study. Computers and Operations Research\u00a037(1), 172\u2013181 (2010)","journal-title":"Computers and Operations Research"},{"issue":"3","key":"16_CR3","first-page":"582","volume":"E80A","author":"M. Moser","year":"1997","unstructured":"Moser, M., Jokanovic, D.P., Shiratori, N.: An Algorithm for the Multidimensional Multiple-Choice Knapsack Problem. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences\u00a0E80A(3), 582\u2013589 (1997)","journal-title":"IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences"},{"issue":"12","key":"16_CR4","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 Solution to Zero-One Programming Problems. Management Science\u00a021(12), 1417\u20131427 (1975)","journal-title":"Management Science"},{"key":"16_CR5","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. Studia Informatica Universalis\u00a02, 157\u2013178 (2002)","journal-title":"Studia Informatica Universalis"},{"issue":"2-3","key":"16_CR6","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. Computational Optimization and Applications\u00a033(2-3), 271\u2013285 (2006)","journal-title":"Computational Optimization and Applications"},{"issue":"1","key":"16_CR7","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/s10589-008-9184-7","volume":"46","author":"N. Cherfi","year":"2008","unstructured":"Cherfi, N., Hifi, M.: A Column Generation Method for the Multiple-Choice Multi-Dimensional Knapsack Problem. Computational Optimization and Applications\u00a046(1), 51\u201373 (2008)","journal-title":"Computational Optimization and Applications"},{"issue":"1","key":"16_CR8","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. Operational Research\u00a05(1), 89\u2013109 (2009)","journal-title":"Int. J. Operational Research"},{"issue":"5","key":"16_CR9","doi-asserted-by":"publisher","first-page":"1259","DOI":"10.1016\/j.cor.2004.09.016","volume":"33","author":"M.M. Akbar","year":"2006","unstructured":"Akbar, M.M., Rahman, M.S., Kaykobad, M., Manning, E.G., Shoja, G.C.: Solving the Multidimensional Multiple-Choice Knapsack Problem by Constructing Convex Hulls. Computers & Operations Research\u00a033(5), 1259\u20131273 (2006)","journal-title":"Computers & Operations Research"},{"issue":"4","key":"16_CR10","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. Journal of Combinatorial Optimization\u00a013(4), 337\u2013351 (2007)","journal-title":"Journal of Combinatorial Optimization"},{"issue":"5","key":"16_CR11","doi-asserted-by":"publisher","first-page":"708","DOI":"10.1109\/TSMCA.2005.851140","volume":"35","author":"R. Parra-Hernandez","year":"2005","unstructured":"Parra-Hernandez, R., Dimopoulos, N.J.: A New Heuristic for Solving the Multichoice Multidimensional Knapsack Problem. IEEE Transactions on Systems Man and Cybernetics Part A-Systems and Humans\u00a035(5), 708\u2013717 (2005)","journal-title":"IEEE Transactions on Systems Man and Cybernetics Part A-Systems and Humans"},{"key":"16_CR12","volume-title":"Genetic Algorithm and Its Applications","author":"G. Chen","year":"1995","unstructured":"Chen, G., Wang, X., Zhuang, Z., Wang, D.: Genetic Algorithm and Its Applications. Posts & Telecommunications Press, Beijing (1995) (in Chinese)"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Raidl, G.R.: An Improved Genetic Algorithm for the Multiconstrained 0-1 Knapsack Problem. In: Proceedings of the 1998, IEEE International Conference on Evolutionary Computation, pp. 207\u2013211 (1998)","DOI":"10.1109\/ICEC.1998.699502"},{"key":"16_CR14","unstructured":"Liu, B.: Evolutionary Algorithms for the Multiple-Choice Multidimensional 0-1 Knapsack Problem. Undergraduate Thesis, School of Computer Science and Technology, University of Science and Technology of China (2008) (in Chinese)"},{"issue":"2-4","key":"16_CR15","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/S0045-7825(99)00389-8","volume":"186","author":"K. Deb","year":"2000","unstructured":"Deb, K.: An Efficient Constraint Handling Method for Genetic Algorithms. Computer Methods in Applied Mechanics and Engineering\u00a0186(2-4), 311\u2013338 (2000)","journal-title":"Computer Methods in Applied Mechanics and Engineering"},{"key":"16_CR16","unstructured":"http:\/\/people.brunel.ac.uk\/~mastjjb\/jeb\/orlib\/files"}],"container-title":["Lecture Notes in Computer Science","Advances in Computation and Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16493-4_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T18:56:22Z","timestamp":1740596182000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16493-4_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642164927","9783642164934"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16493-4_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}