{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:27:37Z","timestamp":1725600457241},"publisher-location":"Boston, MA","reference-count":20,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9781461356042"},{"type":"electronic","value":"9781461515395"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/978-1-4615-1539-5_9","type":"book-chapter","created":{"date-parts":[[2011,8,12]],"date-time":"2011-08-12T08:27:30Z","timestamp":1313137650000},"page":"195-209","source":"Crossref","is-referenced-by-count":1,"title":["Solving the 0-1 Knapsack Problem with EDAs"],"prefix":"10.1007","author":[{"given":"R.","family":"Sagarna","sequence":"first","affiliation":[]},{"given":"P.","family":"Larra\u00f1aga","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"1130","DOI":"10.1287\/opre.28.5.1130","volume":"28","author":"E Balas","year":"1980","unstructured":"Balas, E. and Zemel, E. (1980). An algorithm for large zero-one knapsack problems. Operations Research, 28:1130\u20131154.","journal-title":"Operations Research"},{"key":"9_CR2","series-title":"CMU-CS-95-193","volume-title":"An empirical comparison of seven iterative and evolutionary function optimization heuristics. Technical report, School of Computer Science. Carnegie Mellon University","author":"S Baluja","year":"1995","unstructured":"Baluja, S. (1995). An empirical comparison of seven iterative and evolutionary function optimization heuristics. Technical report, School of Computer Science. Carnegie Mellon University. CMU-CS-95\u2013193."},{"key":"9_CR3","series-title":"In AAAI-98","volume-title":"ast probabilistic modeling for combinatorial optimization","author":"S Baluja","year":"1998","unstructured":"Baluja, S. and Davies, S. (1998). Fast probabilistic modeling for combinatorial optimization. In AAAI-98."},{"key":"9_CR4","series-title":"Workshop Notes of CaNew2000: Workshop on Bayesian and Causal Networks: From Inference to Data Mining. Fourteenth European Conference on Artificial Intelligence, ECAI2000.","volume-title":"Inexact graph matching using learning and simulation of Bayesian networks. An empirical comparison between different approaches with synthetic data","author":"E Bengoetxea","year":"2000","unstructured":"Bengoetxea, E., Larra\u00f1aga, P., Bloch, I., Perchant, A., and Boeres, C. (2000). Inexact graph matching using learning and simulation of Bayesian networks. An empirical comparison between different approaches with synthetic data. In Workshop Notes of CaNew2000: Workshop on Bayesian and Causal Networks: From Inference to Data Mining. Fourteenth European Conference on Artificial Intelligence, ECAI2000."},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1023\/A:1009642405419","volume":"4","author":"PC Chu","year":"1998","unstructured":"Chu, P.C. and Beasley, J.E. (1998). A genetic algorithm for the multidimensional knapsack problem. Journal of Heuristics, 4:63\u201386.","journal-title":"Journal of Heuristics"},{"key":"9_CR6","first-page":"49","volume":"36","author":"RS Dembo","year":"1980","unstructured":"Dembo, R.S. and Hammer, P.L. (1980). A reduction algorithm for knapsack problems. Methods\n                  of Operational Research, 36:49\u201360.","journal-title":"Methodsof Operational Research"},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF02241754","volume":"28","author":"D Fayard","year":"1982","unstructured":"Fayard, D. and Plateau, G. (1982). An algorithm for the solution of the 0\u20131 knapsack problem. Computing, 28:269\u2013287.","journal-title":"Computing"},{"key":"9_CR8","volume-title":"Computers and Intractability. A Guide to the Theory of NP-completeness. W.H","author":"MR Garey","year":"1979","unstructured":"Garey, M.R. and Johnson, D.S. (1979). Computers and Intractability. A Guide to the Theory of NP-completeness. W.H. Freman Co., San Francisco."},{"key":"9_CR9","series-title":"Department of Computer Science","volume-title":"A note on the performance of genetic algorithms on zero-one knapsack problem. Technical report","author":"WS Gordon","year":"1993","unstructured":"Gordon, W.S., Bohm, A.P.W., and Whitney, D. (1993). A note on the performance of genetic algorithms on zero-one knapsack problem. Technical report, Department of Computer Science. Technical Report CS-93\u2013108. Colorado State University."},{"key":"9_CR10","first-page":"13","volume-title":"Mapping, order-independent genes and the knapsack problem. In IEEE Conference","author":"R Hinterding","year":"1994","unstructured":"Hinterding, R. (1994). Mapping, order-independent genes and the knapsack problem. In IEEE Conference, pages 13\u201317."},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1287\/mnsc.20.4.460","volume":"20","author":"GP Ingargiola","year":"1973","unstructured":"Ingargiola, G.P. and Korsh, J.F. (1973). A reduction algorithm for zero-one single knapsack problems. Management Science, 20:460\u2013463.","journal-title":"Management Science"},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1287\/mnsc.34.5.633","volume":"34","author":"S Martello","year":"1988","unstructured":"Martello, S. and Toth, P. (1988). A new algorithm for the 0\u20131 knapsack problem. Management Science, 34:633\u2013644.","journal-title":"Management Science"},{"key":"9_CR13","volume-title":"Knapsack Problems: Algorithms and Computer Implementations. John Wiley and Sons","author":"S Martello","year":"1990","unstructured":"Martello, S. and Toth, P. (1990). Knapsack Problems: Algorithms and Computer Implementations. John Wiley and Sons."},{"key":"9_CR14","first-page":"554","volume-title":"Penalty functions and the knapsack problem. In IEEE Conference","author":"AL Olsen","year":"1994","unstructured":"Olsen, A.L. (1994). Penalty functions and the knapsack problem. In IEEE Conference, pages 554\u2013558."},{"key":"9_CR15","volume-title":"Solving permutation problems with continuous EDAs. Personal communication","author":"M Pelikan","year":"2000","unstructured":"Pelikan, M. (2000). Solving permutation problems with continuous EDAs. Personal communication."},{"issue":"4","key":"9_CR16","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1287\/opre.47.4.570","volume":"47","author":"D Pisinger","year":"1999","unstructured":"Pisinger, D. (1999): Core problems knapsack algorithms. Operations Research, 47(4):570\u2013575.","journal-title":"Operations Research"},{"key":"9_CR17","first-page":"277","volume":"49","author":"G Plateu","year":"1985","unstructured":"Plateu, G. and Elkihel, M. (1985). A hybrid algorithm for the 0\u20131 knapsack problem. Methods of Operations Research, 49:277\u2013293.","journal-title":"Methods of Operations Research"},{"key":"9_CR18","series-title":"Second Symposium on Artificial Intelligence. Adaptive Systems. CIMAF","first-page":"378","volume-title":"Dealing with constraints with Estimation of Distribution Algorithms: The univariate case","author":"R Santana","year":"1999","unstructured":"Santana, R. and Ochoa, A. (1999). Dealing with constraints with Estimation of Distribution Algorithms: The univariate case. In Second Symposium on Artificial Intelligence. Adaptive Systems. CIMAF 99, pages 378\u2013384."},{"key":"9_CR19","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1007\/978-3-7091-6230-9_58","volume-title":"International Conference on Artificial Neural Networks and Genetic Algorithms","author":"A Simoes","year":"2001","unstructured":"Simoes, A. and Costa, E. (2001). An evolutionary approach to the zero-one knapsack problem: Testing ideas from biology. In Kurkov\u00e1, V., Steel, N. C., Neruda, R., and K\u00e1rn\u00ff, M., editors, International Conference on Artificial Neural Networks and Genetic Algorithms. ICANNGA-2001, pages 236\u2013239. Springer."},{"key":"9_CR20","first-page":"1","volume-title":"Improvements of the genetic algorithms and its applications. Technical report, Faculty of Engineering Fuki University","author":"K Watannabe","year":"1992","unstructured":"Watannabe, K., Ikeda, Y., Matsuo, S., and Tsuji, T. (1992). Improvements of the genetic algorithms and its applications. Technical report, Faculty of Engineering Fuki University. Vol. 40, Issue 1."}],"container-title":["Genetic Algorithms and Evolutionary Computation","Estimation of Distribution Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4615-1539-5_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,1]],"date-time":"2021-05-01T09:36:35Z","timestamp":1619861795000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4615-1539-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9781461356042","9781461515395"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-1-4615-1539-5_9","relation":{},"ISSN":["1568-2587"],"issn-type":[{"type":"print","value":"1568-2587"}],"subject":[],"published":{"date-parts":[[2002]]}}}