{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T12:56:53Z","timestamp":1773752213620,"version":"3.50.1"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319234847","type":"print"},{"value":"9783319234854","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-23485-4_31","type":"book-chapter","created":{"date-parts":[[2015,8,24]],"date-time":"2015-08-24T16:07:15Z","timestamp":1440432435000},"page":"298-304","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Memetic Algorithm for Solving the 0-1 Multidimensional Knapsack Problem"],"prefix":"10.1007","author":[{"given":"Abdellah","family":"Rezoug","sequence":"first","affiliation":[]},{"given":"Dalila","family":"Boughaci","sequence":"additional","affiliation":[]},{"given":"Mohamed","family":"Badr-El-Den","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,25]]},"reference":[{"issue":"2","key":"31_CR1","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1287\/ijoc.6.2.154","volume":"6","author":"JC Bean","year":"1994","unstructured":"Bean, J.C.: Genetics and random keys for sequencing and optimization. ORSA Journal of Computing 6(2), 154\u2013160 (1994)","journal-title":"ORSA Journal of Computing"},{"key":"31_CR2","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1002\/1520-6750(200102)48:1<18::AID-NAV2>3.0.CO;2-7","volume":"48","author":"GJ Beaujon","year":"2001","unstructured":"Beaujon, G.J., Martin, S.P., McDonald, C.C.: Balancing and optimizing a portfolio of R&D projects. Naval Research Logistics 48, 18\u201340 (2001)","journal-title":"Naval Research Logistics"},{"issue":"1","key":"31_CR3","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s10852-010-9127-z","volume":"9","author":"D Boughaci","year":"2010","unstructured":"Boughaci, D., Benhamou, B., Drias, H.: Local Search Methods for the Optimal Winner Determination Problem in Combinatorial Auctions. Math. Model. Algor. 9(1), 165\u2013180 (2010)","journal-title":"Math. Model. Algor."},{"key":"31_CR4","doi-asserted-by":"publisher","first-page":"1338","DOI":"10.1016\/j.apm.2013.08.009","volume":"38","author":"M Chih","year":"2014","unstructured":"Chih, M., Lin, C.J., Chern, M.S., Ou, T.Y.: Particle swarm optimization with time-varying acceleration coefficients for the multidimensional knapsack problem. Applied Mathematical Modelling 38, 1338\u20131350 (2014)","journal-title":"Applied Mathematical Modelling"},{"key":"31_CR5","doi-asserted-by":"publisher","first-page":"736","DOI":"10.1057\/palgrave.jors.2600416","volume":"48","author":"JH Cho","year":"1997","unstructured":"Cho, J.H., Kim, Y.D.: A simulated annealing algorithm for resource-constrained project scheduling problems. Operational Research Society 48, 736\u2013744 (1997)","journal-title":"Operational Research Society"},{"key":"31_CR6","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1023\/A:1009642405419","volume":"4","author":"P Chu","year":"1998","unstructured":"Chu, P., Beasley, J.: A Genetic Algorithm for the Multidimensional Knapsack Problem. Heuristics 4, 63\u201386 (1998)","journal-title":"Heuristics"},{"key":"31_CR7","first-page":"250","volume":"3","author":"C Cotta","year":"1994","unstructured":"Cotta, C., Troya, J.: A Hybrid Genetic Algorithm for the 0\u20131 Multiple Knapsack problem. Artificial Neural Nets and Genetic Algorithm 3, 250\u2013254 (1994)","journal-title":"Artificial Neural Nets and Genetic Algorithm"},{"key":"31_CR8","doi-asserted-by":"crossref","unstructured":"Deane, J., Agarwal, A.: Neural, Genetic, And Neurogenetic Approaches For Solving The 0\u20131 Multidimensional Knapsack Problem. Management & Information Systems - First Quarter 2013 17(1) (2013)","DOI":"10.19030\/ijmis.v17i1.7589"},{"key":"31_CR9","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.cor.2011.03.013","volume":"39","author":"F Della Croce","year":"2012","unstructured":"Della Croce, F., Grosso, A.: Improved core problem based heuristics for the 0\u20131 multidimensional knapsack problem. Comp. & Oper. Res. 39, 27\u201331 (2012)","journal-title":"Comp. & Oper. Res."},{"issue":"9","key":"31_CR10","first-page":"443","volume":"3","author":"F Djannaty","year":"2008","unstructured":"Djannaty, F., Doostdar, S.: A Hybrid Genetic Algorithm for the Multidimensional Knapsack Problem. Contemp. Math. Sciences 3(9), 443\u2013456 (2008)","journal-title":"Contemp. Math. Sciences"},{"key":"31_CR11","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s10732-008-9087-x","volume":"16","author":"L Feng","year":"2010","unstructured":"Feng, L., Ke, Z., Ren, Z., Wei, X.: An ant colony optimization approach for the multidimensional knapsack problem. Heuristics 16, 65\u201383 (2010)","journal-title":"Heuristics"},{"key":"31_CR12","doi-asserted-by":"crossref","unstructured":"Feng, Y., Jia, K., He, Y.: An Improved Hybrid Encoding Cuckoo Search Algorithm for 0\u20131 Knapsack Problems. Computational Intelligence and Neuroscience, ID 970456 (2014)","DOI":"10.1155\/2014\/970456"},{"key":"31_CR13","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s10479-009-0660-y","volume":"184","author":"AS Fukunaga","year":"2011","unstructured":"Fukunaga, A.S.: A branch-and-bound algorithm for hard multiple knapsack problems. Annals of Operations Research 184, 97\u2013119 (2011)","journal-title":"Annals of Operations Research"},{"key":"31_CR14","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability: A guide to the theory of NP-completeness. W. H. Freeman & Co, New York (1979)"},{"key":"31_CR15","doi-asserted-by":"crossref","unstructured":"Khuri, S., B\u00e4ck, T., Heitk\u00f6tter, J.: The zero-one multiple knapsack problem and genetic algorithms. In: Proceedings of the ACM Symposium on Applied Computing, pp. 188\u2013193 (1994)","DOI":"10.1145\/326619.326694"},{"key":"31_CR16","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, P.M.: Optimization By Simulated Annealing. Science 220, 671\u2013680 (1983)","journal-title":"Science"},{"key":"31_CR17","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1287\/opre.49.2.196.13531","volume":"49","author":"H Meier","year":"2001","unstructured":"Meier, H., Christofides, N., Salkin, G.: Capital budgeting under uncertainty-an integrated approach using contingent claims analysis and integer programming. Operations Research 49, 196\u2013206 (2001)","journal-title":"Operations Research"},{"key":"31_CR18","doi-asserted-by":"crossref","unstructured":"Tuo, S., Yong, L., Deng, F.: A Novel Harmony Search Algorithm Based on Teaching-Learning Strategies for 0\u20131 Knapsack Problems. The Scientific World Journal Article ID 637412, 19 pages (2014)","DOI":"10.1155\/2014\/637412"},{"key":"31_CR19","first-page":"226","volume":"32","author":"J Thiel","year":"1994","unstructured":"Thiel, J., Voss, S.: Some Experiences on Solving Multiconstraint Zero-One Knapsack Problems with Genetic Algorithms. INFOR 32, 226\u2013242 (1994)","journal-title":"INFOR"},{"key":"31_CR20","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.ejor.2004.01.024","volume":"165","author":"M Vasquez","year":"2005","unstructured":"Vasquez, M., Vimont, Y.: Improved results on the 0\u20131 multidimensional knapsack problem. Eur. J. Oper. Res. 165, 70\u201381 (2005)","journal-title":"Eur. J. Oper. Res."},{"key":"31_CR21","doi-asserted-by":"crossref","unstructured":"Yoon, Y., Kim, Y.H.: A Memetic Lagrangian Heuristic for the 0\u20131 Multidimensional Knapsack Problem. Discrete Dynamics in Nature and Society, Article ID 474852, 10 pages (2013)","DOI":"10.1155\/2013\/474852"},{"key":"31_CR22","unstructured":"http:\/\/people.brunel.ac.uk\/~mastjjb\/jeb\/orlib\/mknapinfo.html"}],"container-title":["Lecture Notes in Computer Science","Progress in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-23485-4_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T18:08:23Z","timestamp":1675274903000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-23485-4_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319234847","9783319234854"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23485-4_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"25 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}