{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:44:15Z","timestamp":1725551055234},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540253372"},{"type":"electronic","value":"9783540319962"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31996-2_16","type":"book-chapter","created":{"date-parts":[[2010,3,31]],"date-time":"2010-03-31T21:17:28Z","timestamp":1270070248000},"page":"166-176","source":"Crossref","is-referenced-by-count":5,"title":["Population Training Heuristics"],"prefix":"10.1007","author":[{"given":"Alexandre C. M.","family":"Oliveira","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luiz A. N.","family":"Lorena","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"16_CR1","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1162\/106365601750406019","volume":"9","author":"L.A.N. Lorena","year":"2001","unstructured":"Lorena, L.A.N., Furtado, J.C.: Constructive genetic algorithm for clustering problems. Evolutionary Computation\u00a09(3), 309\u2013327 (2001)","journal-title":"Evolutionary Computation"},{"key":"16_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/3-540-45365-2_14","volume-title":"Applications of Evolutionary Computing","author":"G. Ribeiro Filho","year":"2001","unstructured":"Ribeiro Filho, G., Lorena, L.A.N.: A constructive evolutionary approach to school timetabling. In: Boers, E.J.W., Gottlieb, J., Lanzi, P.L., Smith, R.E., Cagnoni, S., Hart, E., Raidl, G.R., Tijink, H. (eds.) EvoIASP 2001, EvoWorkshops 2001, EvoFlight 2001, EvoSTIM 2001, EvoCOP 2001, and EvoLearn 2001. LNCS, vol.\u00a02037, pp. 130\u2013139. Springer, Heidelberg (2001)"},{"issue":"8","key":"16_CR3","doi-asserted-by":"publisher","first-page":"969","DOI":"10.1109\/TCAD.2002.800454","volume":"21","author":"A.C.M. Oliveira","year":"2002","unstructured":"Oliveira, A.C.M., Lorena, L.A.N.: A constructive genetic algorithm for gate matrix layout problems. IEEE Trans. on Computer-Aided Designed of Integrated Circuits and Systems\u00a021(8), 969\u2013974 (2002)","journal-title":"IEEE Trans. on Computer-Aided Designed of Integrated Circuits and Systems"},{"key":"16_CR4","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/3-540-36127-8_30","volume-title":"Advances in Artificial Intelligence","author":"A.C.M. Oliveira","year":"2002","unstructured":"Oliveira, A.C.M., Lorena, L.A.N.: 2-opt population training for minimization of open stack problem. In: Bittencourt, G., Ramalho, G.L. (eds.) SBIA 2002. LNCS (LNAI), vol.\u00a02507, pp. 313\u2013323. Springer, Heidelberg (2002)"},{"unstructured":"Oliveira, A.C.M., Lorena, L.A.N.: Real-coded evolutionary approaches to unconstrained numerical optimization. In: Abe, J.M., da Silva Filho, J.I. (eds.) Advances in Logic, Artificial Intelligence and Robotics, pp. 10\u201315 (2002)","key":"16_CR5"},{"doi-asserted-by":"crossref","unstructured":"Reeves, C.R.: Landscapes, operators and heuristic search. In: Annals of Operations Research, vol.\u00a086, pp. 473\u2013490 (1999)","key":"16_CR6","DOI":"10.1023\/A:1018983524911"},{"issue":"1","key":"16_CR7","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0305-0548(98)80001-4","volume":"26","author":"A. Fink","year":"1999","unstructured":"Fink, A., Voss, S.: Applications of modern heuristic search methods to pattern sequencing problems. Computers and Operations Research\u00a026(1), 17\u201334 (1999)","journal-title":"Computers and Operations Research"},{"key":"16_CR8","volume-title":"Algorithmic graph theory and perfect graphs","author":"M. Golumbic","year":"1980","unstructured":"Golumbic, M.: Algorithmic graph theory and perfect graphs. Academic Press, New York (1980)"},{"key":"16_CR9","first-page":"17","volume":"7","author":"R. M\u00f6hring","year":"1990","unstructured":"M\u00f6hring, R.: Graph problems related to gate matrix layout and PLA folding. Computing\u00a07, 17\u201351 (1990)","journal-title":"Computing"},{"unstructured":"Kashiwabara, T., Fujisawa, T.: NP-Completeness of the problem of finding a minimum clique number interval graph containing a given graph as a subgraph. In: Proc. Symposium of Circuits and Systems (1979)","key":"16_CR10"},{"unstructured":"Linhares, A.: Industrial pattern sequencing problems: some complexity results and new local search models. Doctoral Thesis, INPE, S. Jos\u00e9 dos Campos, Brazil (2002)","key":"16_CR11"},{"key":"16_CR12","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1016\/S0377-2217(97)00268-3","volume":"110","author":"E. Faggioli","year":"1998","unstructured":"Faggioli, E., Bentivoglio, C.A.: Heuristic and exact methods for the cutting sequencing problem. European Journal of Operational Research\u00a0110, 564\u2013575 (1998)","journal-title":"European Journal of Operational Research"},{"key":"16_CR13","series-title":"Handbook of Genetic Algorithms","first-page":"332","volume-title":"Schedule optimization using genetic algorithms","year":"1991","unstructured":"Syswerda, G. (ed.): Schedule optimization using genetic algorithms. Handbook of Genetic Algorithms, pp. 332\u2013349. Van Nostrand Reinhold, New York (1991)"},{"issue":"1","key":"16_CR14","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1080\/00207720310001657054","volume":"35","author":"A. Mendes","year":"2004","unstructured":"Mendes, A., Linhares, A.: A multiple population evolutionary approach to gate matrix layout. Int. Journal of Systems Science, Taylor & Francis Eds.\u00a035(1), 13\u201323 (2004)","journal-title":"Int. Journal of Systems Science, Taylor & Francis Eds."}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31996-2_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:33:32Z","timestamp":1605760412000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31996-2_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540253372","9783540319962"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31996-2_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}