{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,21]],"date-time":"2026-09-21T13:49:44Z","timestamp":1789998584161,"version":"4.0.1"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,7,12]],"date-time":"2008-07-12T00:00:00Z","timestamp":1215820800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2008,7,12]]},"DOI":"10.1145\/1389095.1389335","type":"proceedings-article","created":{"date-parts":[[2008,7,22]],"date-time":"2008-07-22T13:46:39Z","timestamp":1216734399000},"page":"1227-1234","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["Evolution of hyperheuristics for the biobjective 0\/1 knapsack problem by multiobjective genetic programming"],"prefix":"10.1145","author":[{"given":"Rajeev","family":"Kumar","sequence":"first","affiliation":[{"name":"Indian Institute of Technology Kharagpur, Kharagpur, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ashwin H.","family":"Joshi","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology Kharagpur, Kharagpur, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Krishna K.","family":"Banka","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology Kharagpur, Kharagpur, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peter I.","family":"Rockett","sequence":"additional","affiliation":[{"name":"University of Sheffield, Sheffield, United Kngdm"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2008,7,12]]},"reference":[{"issue":"1","key":"e_1_3_2_1_1_1","first-page":"8","article-title":"Genetic tabu search for the multi-objective knapsack problem","volume":"8","author":"Barichard V.","year":"2003","unstructured":"V. Barichard and J.-K. Hao . Genetic tabu search for the multi-objective knapsack problem . Journal of Tsinghua Science and Technology , 8 ( 1 ): 8 -- 13 , 2003 . V. Barichard and J.-K. Hao. Genetic tabu search for the multi-objective knapsack problem. Journal of Tsinghua Science and Technology, 8(1):8--13, 2003.","journal-title":"Journal of Tsinghua Science and Technology"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/11844297_87"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1276958.1277273"},{"key":"e_1_3_2_1_4_1","first-page":"213","volume-title":"Proc. of 11th Annual ACM-SIAM symposium on Discrete Algorithms","author":"Chekuri C.","year":"2000","unstructured":"C. Chekuri and S. Khanna . A PTAS for the multiple knapsack problem . In Proc. of 11th Annual ACM-SIAM symposium on Discrete Algorithms , pages 213 -- 222 , 2000 . C. Chekuri and S. Khanna. A PTAS for the multiple knapsack problem. In Proc. of 11th Annual ACM-SIAM symposium on Discrete Algorithms, pages 213--222, 2000."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009642405419"},{"key":"e_1_3_2_1_6_1","volume-title":"Multiobjective Optimization Using Evolutionary Algorithms","author":"Deb K.","year":"2001","unstructured":"K. Deb . Multiobjective Optimization Using Evolutionary Algorithms . Chichester, UK : Wiley , 2001 . K. Deb. Multiobjective Optimization Using Evolutionary Algorithms. Chichester, UK: Wiley, 2001."},{"key":"e_1_3_2_1_7_1","first-page":"13","volume-title":"Proceedings of the 4th Asia-Pacific Conference on Simulated Evolution and Learning (SEAL'02)","volume":"1","author":"Deb K.","year":"2002","unstructured":"K. Deb and S. Jain . Running performance metrics for evolutionary multi-objective optimization. In L. Wang et al., editors , Proceedings of the 4th Asia-Pacific Conference on Simulated Evolution and Learning (SEAL'02) , volume 1 , pages 13 -- 20 , November 2002 , Nanyang Technical University, Singapore. K. Deb and S. Jain. Running performance metrics for evolutionary multi-objective optimization. In L. Wang et al., editors, Proceedings of the 4th Asia-Pacific Conference on Simulated Evolution and Learning (SEAL'02), volume 1, pages 13--20, November 2002, Nanyang Technical University, Singapore."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.48.12.1603.445"},{"key":"e_1_3_2_1_9_1","first-page":"416","volume-title":"5th International Conference of Genetic Algorithms","author":"Fonseca C. M.","year":"1993","unstructured":"C. M. Fonseca and P. J. Fleming . Genetic algorithms for multiobjective optimization: Formulation, discussion and generalization. In S. Forrest, editor , 5th International Conference of Genetic Algorithms , pages 416 -- 423 . Morgan Kaufmann , 1993 . C. M. Fonseca and P. J. Fleming. Genetic algorithms for multiobjective optimization: Formulation, discussion and generalization. In S. Forrest, editor, 5th International Conference of Genetic Algorithms, pages 416--423. Morgan Kaufmann, 1993."},{"key":"e_1_3_2_1_10_1","first-page":"100","article-title":"Approximation algorithms for m-dimensional 0-1 knapsack problem: Worst case and probabilistic analysis. European Journal","volume":"15","author":"Frieze A.","year":"1984","unstructured":"A. Frieze and M. Clarke . Approximation algorithms for m-dimensional 0-1 knapsack problem: Worst case and probabilistic analysis. European Journal , Operations Research , 15 : 100 -- 109 , 1984 . A. Frieze and M. Clarke. Approximation algorithms for m-dimensional 0-1 knapsack problem: Worst case and probabilistic analysis. European Journal, Operations Research, 15:100--109, 1984.","journal-title":"Operations Research"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009682532542"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-005-3448-8"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71618-1_40"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/321906.321909"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2002.802873"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2000.870313"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2002.1007013"},{"key":"e_1_3_2_1_18_1","volume-title":"Genetic Programming: On the Programming of Computers by Means of Natural Selection","author":"Koza J. R.","year":"1992","unstructured":"J. R. Koza . Genetic Programming: On the Programming of Computers by Means of Natural Selection . MIT Press , Cambridge, MA, USA , 1992 . J. R. Koza. Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge, MA, USA, 1992."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/11513575_7"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.03.007"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1162\/106365602760234117"},{"key":"e_1_3_2_1_22_1","series-title":"Advances in Soft Computing","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/978-3-540-36266-1_32","volume-title":"A. Tiwari et al.","author":"Kumar R.","year":"2006","unstructured":"R. Kumar , P. K. Singh , A. P. Singhal , and A. Bhartia . Evolutionary and heuristic algorithms for 0-1 knapsack problem . In A. Tiwari et al. , editors, Applications of Soft Computing, volume 36 of Advances in Soft Computing , pages 331 -- 340 . Springer , 2006 . R. Kumar, P. K. Singh, A. P. Singhal, and A. Bhartia. Evolutionary and heuristic algorithms for 0-1 knapsack problem. In A. Tiwari et al., editors, Applications of Soft Computing, volume 36 of Advances in Soft Computing, pages 331--340. Springer, 2006."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.4.4.339"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(81)90175-2"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/645824.668591"},{"key":"e_1_3_2_1_26_1","unstructured":"S.Goddard. Dynamic programming for 0-1 knapsack problem. http:\/\/www.cse.unl.edu\/ goddard\/Courses\/CSCE310J\/Lectures\/Lecture8-DynamicProgramming.pdf.  S.Goddard. Dynamic programming for 0-1 knapsack problem. http:\/\/www.cse.unl.edu\/ goddard\/Courses\/CSCE310J\/Lectures\/Lecture8-DynamicProgramming.pdf."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/4235.797969"}],"event":{"name":"GECCO08: Genetic and Evolutionary Computation Conference","location":"Atlanta GA USA","acronym":"GECCO08","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 10th annual conference on Genetic and evolutionary computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1389095.1389335","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1389095.1389335","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:56:37Z","timestamp":1750254997000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1389095.1389335"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7,12]]},"references-count":27,"alternative-id":["10.1145\/1389095.1389335","10.1145\/1389095"],"URL":"https:\/\/doi.org\/10.1145\/1389095.1389335","relation":{},"subject":[],"published":{"date-parts":[[2008,7,12]]},"assertion":[{"value":"2008-07-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}