{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,31]],"date-time":"2025-03-31T01:10:19Z","timestamp":1743383419978,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642309755"},{"type":"electronic","value":"9783642309762"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30976-2_41","type":"book-chapter","created":{"date-parts":[[2012,6,12]],"date-time":"2012-06-12T16:58:11Z","timestamp":1339520291000},"page":"342-349","source":"Crossref","is-referenced-by-count":0,"title":["A Differentiating Evolutionary Computation Approach for the Multidimensional Knapsack Problem"],"prefix":"10.1007","author":[{"given":"Meysam Mohagheghi","family":"Fard","sequence":"first","affiliation":[]},{"given":"Yoon-Teck","family":"Bau","sequence":"additional","affiliation":[]},{"given":"Chien-Le","family":"Goh","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"41_CR1","doi-asserted-by":"crossref","unstructured":"Petersen, C.C.: Computational Experience with Variants of the Balas Algorithm Applied to the Selection of R&D Projects. Management Science, 736 (1967)","DOI":"10.1287\/mnsc.13.9.736"},{"issue":"1","key":"41_CR2","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. Journal of Heuristics\u00a04(1), 63\u201386 (1998)","journal-title":"Journal of Heuristics"},{"key":"41_CR3","unstructured":"Zitzler, E., Laumanns, M., Thiele, L.: SPEA2: Improving the Strength Pareto Evolutionary Algorithm. Technical Report 103, Swiss Federal Institute of Technology (ETH) Zurich, Computer Engineering and Networks Laboratory (TIK), Department of Electrical Engineering (2001)"},{"issue":"2","key":"41_CR4","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K. Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation\u00a06(2), 182\u2013197 (2002)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"41_CR5","doi-asserted-by":"crossref","unstructured":"Shao, Y., Xu, H., Yin, W.: Solve Zero-One Knapsack Problem by Greedy Genetic Algorithm. In: IEEE 2009 International Workshop on Intelligent Systems and Applications (ISA), pp. 1\u20134 (2009)","DOI":"10.1109\/IWISA.2009.5073116"},{"key":"41_CR6","doi-asserted-by":"crossref","unstructured":"Lin, C.: A Heuristic Genetic Algorithm Based on Schema Replacement for 0-1 Knapsack Problem. In: 2010 Fourth International Conference on Genetic and Evolutionary Computing (ICGEC), Shenzhen, China, pp. 301\u2013304 (2010)","DOI":"10.1109\/ICGEC.2010.81"},{"issue":"1","key":"41_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0377-2217(03)00274-1","volume":"155","author":"A. Fr\u00e9ville","year":"2004","unstructured":"Fr\u00e9ville, A.: The multidimensional 0\u20131 knapsack problem: An overview. European Journal of Operational Research\u00a0155(1), 1\u201321 (2004)","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"41_CR8","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s10479-006-0150-4","volume":"150","author":"Y. Ak\u00e7ay","year":"2007","unstructured":"Ak\u00e7ay, Y., Li, H., Xu, S.: Greedy algorithm for the general multidimensional knapsack problem. Annals of Operations Research\u00a0150(1), 17\u201329 (2007)","journal-title":"Annals of Operations Research"},{"key":"41_CR9","unstructured":"Beasley, J.: OR-Library, Multidimensional knapsack problem, http:\/\/people.brunel.ac.uk\/~mastjjb\/jeb\/orlib\/mknapinfo.html"}],"container-title":["Lecture Notes in Computer Science","Advances in Swarm Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30976-2_41.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,31]],"date-time":"2025-03-31T00:29:01Z","timestamp":1743380941000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30976-2_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642309755","9783642309762"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30976-2_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}