{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:30:58Z","timestamp":1760707858030},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540001317"},{"type":"electronic","value":"9783540361312"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36131-6_33","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T01:42:30Z","timestamp":1186882950000},"page":"319-328","source":"Crossref","is-referenced-by-count":1,"title":["Population Studies for the Gate Matrix Layout Problem"],"prefix":"10.1007","author":[{"given":"Alexandre","family":"Mendes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paulo","family":"Fran\u00e7a","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pablo","family":"Moscato","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vin\u00edcius","family":"Garcia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,11,5]]},"reference":[{"issue":"1","key":"33_CR1","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1016\/S0377-2217(00)00140-5","volume":"132","author":"P. M. Fran\u00e7a","year":"2001","unstructured":"Fran\u00e7a, P. M., Mendes, A. S. and Moscato, P.: A memetic algorithm for the total tardiness Single Machine Scheduling problem. European Journal of Operational Research, v. 132, n. 1 (2001) 224\u2013242","journal-title":"European Journal of Operational Research"},{"key":"33_CR2","doi-asserted-by":"publisher","first-page":"836","DOI":"10.1109\/43.57791","volume":"9","author":"Y. H. Hu","year":"1990","unstructured":"Hu, Y. H. and Chen, S. J.: GM_Plan: A gate matrix layout algorithm based on artificial intelligence planning techniques. IEEE Transactions on Computer-Aided Design, v. 9 (1990) 836\u2013845","journal-title":"IEEE Transactions on Computer-Aided Design"},{"key":"33_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-322-92106-2","volume-title":"Combinatorial algorithms for integrated circuit layout","author":"T. Lengauer","year":"1990","unstructured":"Lengauer, T.: Combinatorial algorithms for integrated circuit layout. John Wiley amp; Sons, New York (1990)"},{"issue":"2","key":"33_CR4","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1109\/4235.771168","volume":"3","author":"A. Linhares","year":"1999","unstructured":"Linhares, A.: Synthesizing a Predatory Search Strategy for VLSI Layouts, IEEE Transactions on Evolutionary Computation, v. 3, n. 2 (1999) 147\u2013152","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"12","key":"33_CR5","doi-asserted-by":"publisher","first-page":"1750","DOI":"10.1109\/43.811324","volume":"18","author":"A. Linhares","year":"1999","unstructured":"Linhares, A., Yanasse, H. and Torre\u00e3o, J.: Linear Gate Assignment: a Fast Statistical Mechanics Approach. IEEE Transactions on Computer-Aided Design on Integrated Circuits and Systems, v. 18, n. 12 (1999) 1750\u20131758","journal-title":"IEEE Transactions on Computer-Aided Design on Integrated Circuits and Systems"},{"key":"33_CR6","unstructured":"Mendes, A. S., Fran\u00e7a, P. M. and Moscato, P.: NP-Opt: An Optimization Framework for NP Problems. Proceedings of POM2001-International Conference of the Production and Operations Management Society (2001) 82\u201389"},{"key":"33_CR7","unstructured":"Moscato, P.: On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts: Towards Memetic Algorithms. Caltech Concurrent Computation Program, C3P Report 826. (1989)"},{"key":"33_CR8","unstructured":"Nakatani, K., Fujii, T., Kikuno, T. and Yoshida, N.: A heuristic algorithm for gate matrix layout. Proceedings of International Conference of Computer-Aided Design (1986) 324\u2013327"},{"key":"33_CR9","first-page":"187","volume-title":"Implementation of a Computational Ecology for Combinatorial Optimization on Message-Passing Systems, Parallel Computing and Transputer Applications","author":"P. Moscato","year":"1992","unstructured":"Moscato, P. and Norman, M. G.: A \u2018Memetic\u2019 Approach for the Traveling Salesman Problem. Implementation of a Computational Ecology for Combinatorial Optimization on Message-Passing Systems, Parallel Computing and Transputer Applications, edited by M. Valero, E. Onate, M. Jane, J.L. Larriba and B. Suarez, Ed. IOS Press, Amsterdam (1992) 187\u2013194"}],"container-title":["Lecture Notes in Computer Science","Advances in Artificial Intelligence \u2014 IBERAMIA 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36131-6_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,25]],"date-time":"2020-04-25T16:21:35Z","timestamp":1587831695000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36131-6_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540001317","9783540361312"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-36131-6_33","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}