{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T12:56:51Z","timestamp":1773752211214,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540263197","type":"print"},{"value":"9783540316732","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11499305_3","type":"book-chapter","created":{"date-parts":[[2010,4,9]],"date-time":"2010-04-09T05:39:11Z","timestamp":1270791551000},"page":"21-30","source":"Crossref","is-referenced-by-count":11,"title":["Solving the Multidimensional Knapsack Problem Using an Evolutionary Algorithm Hybridized with Branch and Bound"],"prefix":"10.1007","author":[{"given":"Jos\u00e9 E.","family":"Gallardo","sequence":"first","affiliation":[]},{"given":"Carlos","family":"Cotta","sequence":"additional","affiliation":[]},{"given":"Antonio J.","family":"Fern\u00e1ndez","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","first-page":"669","volume":"4","author":"E. Lawler","year":"1966","unstructured":"Lawler, E., Wood, D.: Branch and bounds methods: A survey. Operations Research\u00a04, 669\u2013719 (1966)","journal-title":"Operations Research"},{"key":"3_CR2","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195099713.001.0001","volume-title":"Evolutionary Algorithms in Theory and Practice","author":"T. B\u00e4ck","year":"1996","unstructured":"B\u00e4ck, T.: Evolutionary Algorithms in Theory and Practice. Oxford University Press, New York (1996)"},{"key":"3_CR3","doi-asserted-by":"publisher","DOI":"10.1887\/0750308958","volume-title":"Handbook of Evolutionary Computation","author":"T. B\u00e4ck","year":"1997","unstructured":"B\u00e4ck, T., Fogel, D., Michalewicz, Z.: Handbook of Evolutionary Computation. Oxford University Press, New York (1997)"},{"key":"3_CR4","volume-title":"Handbook of Genetic Algorithms","author":"L. Davis","year":"1991","unstructured":"Davis, L.: Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York (1991)"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"D. Wolpert","year":"1997","unstructured":"Wolpert, D., Macready, W.: No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation\u00a01, 67\u201382 (1997)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1162\/evco.1998.6.2.109","volume":"6","author":"J. Culberson","year":"1998","unstructured":"Culberson, J.: On the futility of blind search: An algorithmic view of no free lunch. Evolutionary Computation\u00a06, 109\u2013128 (1998)","journal-title":"Evolutionary Computation"},{"key":"3_CR7","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman and Co, San Francisco (1979)"},{"key":"3_CR8","volume-title":"Foundations of Integer Programming","author":"H. Salkin","year":"1989","unstructured":"Salkin, H., Mathur, K.: Foundations of Integer Programming. North-Holland, Amsterdam (1989)"},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1145\/326619.326694","volume-title":"Proceedings of the 1994 ACM Symposium on Applied Computation","author":"S. Khuri","year":"1994","unstructured":"Khuri, S., B\u00e4ck, T., Heitk\u00f6tter, J.: The zero\/one multiple knapsack problem and genetic algorithms. In: Deaton, E., Oppenheim, D., Urban, J., Berghel, H. (eds.) Proceedings of the 1994 ACM Symposium on Applied Computation, pp. 188\u2013193. ACM Press, New York (1994)"},{"key":"3_CR10","first-page":"251","volume-title":"Artificial Neural Nets and Genetic Algorithms 3","author":"C. Cotta","year":"1998","unstructured":"Cotta, C., Troya, J.: A hybrid genetic algorithm for the 0-1 multiple knapsack problem. In Smith, G., Steele, N., Albrecht, R., eds.: Artificial Neural Nets and Genetic Algorithms 3, Wien New York, Springer-Verlag (1998) 251\u2013255"},{"key":"3_CR11","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1023\/A:1009642405419","volume":"4","author":"P.C. Chu","year":"1998","unstructured":"Chu, P.C., Beasley, J.E.: A genetic algorithm for the multidimensional knapsack problem. Journal of Heuristics\u00a04, 63\u201386 (1998)","journal-title":"Journal of Heuristics"},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1145\/335603.335866","volume-title":"ACM Symposium on Applied Computing 2000","author":"J. Gottlieb","year":"2000","unstructured":"Gottlieb, J.: Permutation-based evolutionary algorithms for multidimensional knapsack problems. In: Carroll, J., Damiani, E., Haddad, H., Oppenheim, D. (eds.) ACM Symposium on Applied Computing 2000, pp. 408\u2013414. ACM Press, New York (2000)"},{"key":"3_CR13","unstructured":"Raidl, G., Gottlieb, J.: Empirical analysis of locality, heritability and heuristic bias in evolutionary algorithms: A case study for the multidimensional knapsack problem. Technical Report TR 186\u20131\u201304\u201305, Institute of Computer Graphics and Algorithms, Vienna University of Technology (2004)"},{"key":"3_CR14","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/978-3-7091-7535-4_73","volume-title":"Artificial Neural Nets and Genetic Algorithms 2","author":"C. Cotta","year":"1995","unstructured":"Cotta, C., Aldana, J.F., Nebro, A.J., Troya, J.M.: Hybridizing genetic algorithms with branch and bound techniques for the resolution of the TSP. In: Pearson, D.W., Steele, N.C., Albrecht, R.F. (eds.) Artificial Neural Nets and Genetic Algorithms 2, Wien, New York, pp. 277\u2013280. Springer, Heidelberg (1995)"},{"key":"3_CR15","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0377-2217(82)90015-7","volume":"9","author":"A. Volgenant","year":"1982","unstructured":"Volgenant, A., Jonker, R.: A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation. European Journal of Operational Research\u00a09, 83\u201388 (1982)","journal-title":"European Journal of Operational Research"},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/BF02125405","volume":"63","author":"A. Nagard","year":"1996","unstructured":"Nagard, A., Heragu, S.S., Haddock, J.: A combined branch and bound and genetic algorithm based for a flowshop scheduling algorithm. Annals of Operation Research\u00a063, 397\u2013414 (1996)","journal-title":"Annals of Operation Research"},{"key":"3_CR17","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1023\/A:1011921025322","volume":"7","author":"A. French","year":"2001","unstructured":"French, A., Robinson, A., Wilson, J.: Using a hybrid genetic-algorithm\/branch and bound approach to solve feasibility and optimization integer programming problems. Journal of Heuristics\u00a07, 551\u2013564 (2001)","journal-title":"Journal of Heuristics"},{"key":"3_CR18","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1023\/A:1021934325079","volume":"18","author":"C. Cotta","year":"2003","unstructured":"Cotta, C., Troya, J.: Embedding branch and bound within evolutionary algorithms. Applied Intelligence\u00a018, 137\u2013153 (2003)","journal-title":"Applied Intelligence"},{"key":"3_CR19","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"J. Beasley","year":"1990","unstructured":"Beasley, J.: Or-library: distributing test problems by electronic mail. Journal of the Operational Research Society\u00a041, 1069\u20131072 (1990)","journal-title":"Journal of the Operational Research Society"}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence and Knowledge Engineering Applications: A Bioinspired Approach"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11499305_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,25]],"date-time":"2021-10-25T18:22:13Z","timestamp":1635186133000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11499305_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540263197","9783540316732"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11499305_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}