{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:38:02Z","timestamp":1759847882511},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540001249"},{"type":"electronic","value":"9783540361275"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36127-8_30","type":"book-chapter","created":{"date-parts":[[2007,8,11]],"date-time":"2007-08-11T10:10:12Z","timestamp":1186827012000},"page":"313-323","source":"Crossref","is-referenced-by-count":5,"title":["2-Opt Population Training for Minimization of Open Stack Problem"],"prefix":"10.1007","author":[{"given":"Alexandre C\u00e9sar Muniz","family":"de Oliveira","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luiz Antonio Nogueira","family":"Lorena","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,1,16]]},"reference":[{"issue":"3","key":"30_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, Vol. 9(3) (2001) 309\u2013327","journal-title":"Evolutionary Computation"},{"key":"30_CR2","series-title":"Lect Notes Comput Sci","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: Applications of Evolutionary Computing, Boers, E.J.W., Gottlieb, J., Lanzi, P.L., Smith, R.E., Cagnoni, S., Hart, E., Raidl, G.R., Tijink, H., (eds.): Lecture Notes in Computer Science, Vol. 2037, Springer-Verlag (2001) 130\u2013139"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"Oliveira, A.C.M., Lorena, L.A.N.: A Constructive Genetic Algorithm for Gate Matrix Layout Problems. Accepted to IEEE Transaction on Computer-Aided Designed of Integrated Circuits and Systems (2002)","DOI":"10.1109\/TCAD.2002.800454"},{"key":"30_CR4","first-page":"493","volume":"3","author":"D.E. Goldberg","year":"1989","unstructured":"Goldberg, D.E., Korb, B., Deb, K.: Messy genetic algorithms: motivation, analysis, and first results, Complex Systems, Vol. 3 (1989) 493\u2013530","journal-title":"Complex Systems"},{"key":"30_CR5","volume-title":"IlliGAL Report No. 93004","author":"D.E. Goldberg","year":"1993","unstructured":"Goldberg, D.E., Deb, K., Kargupta, H., Harik, G.: Rapid, accurate optimization of difficult problems using fast messy genetic algorithms, IlliGAL Report No. 93004, Illinois Genetic Algorithms Laboratory, Department of General Engineering, University of Illinois, Urbana (1993)"},{"key":"30_CR6","series-title":"IlliGAL Report","volume-title":"Ph.D. thesis","author":"H. Kargupta","year":"1995","unstructured":"Kargupta, H.: Search, polynomial complexity, and the fast messy genetic algorithm, Ph.D. thesis, IlliGAL Report No. 95008, Illinois Genetic Algorithms Laboratory, Department of General Engineering, University of Illinois, Urbana (1995)"},{"key":"30_CR7","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":"30_CR8","volume-title":"Doctoral Thesis","author":"J.C. Becceneri","year":"1999","unstructured":"Becceneri, J.C.: O problema de sequenciamento de padr\u00f5es para minimiza\u00e7\u00e3o do n\u00famero m\u00e1ximo de pilhas abertas em ambientes de corte industriais. Doctoral Thesis, Institute Tecnol\u00f3gico de Aeron\u00e1utica, S\u00e3o Jos\u00e9 dos Campos, Brazil (1999)"},{"key":"30_CR9","first-page":"1","volume":"16","author":"H.H. Yanasse","year":"1996","unstructured":"Yanasse, H.H.: Minimization of open orders-polynomial algorithms for some special cases. Pesquisa Operacional, Vol. 16 (1996) 1\u201326","journal-title":"Pesquisa Operacional"},{"key":"30_CR10","unstructured":"Andreatta, G., Basso, A., Caumo, A., Deserti, L.: Un problema min cutwidth generalizzato e sue applicazionni ad un FMS. Atti delle giornate di lavoro AIRO, (1989) 1\u201317"},{"key":"30_CR11","volume-title":"Doctoral Thesis","author":"A. Linhares","year":"2002","unstructured":"Linhares, A.: Industrial Pattern Sequencing Problems: Some Complexity Results And New Local Search Models. Doctoral Thesis, Institute Nacional de Pesquisas Espaciais (INPE), S\u00e3o Jos\u00e9 dos Campos, Brazil (2002)"},{"key":"30_CR12","first-page":"17","volume":"7","author":"R. M\u00d6oring","year":"1990","unstructured":"M\u00d6oring, R.: Graph problems related to gate matrix layout and PLA folding, Computing, Vol. 7 (1990) 17\u201351","journal-title":"Computing"},{"key":"30_CR13","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":"30_CR14","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1016\/S0377-2217(97)00268-3","volume":"110","author":"E. Fraggioli","year":"1998","unstructured":"Fraggioli, E., Bentivoglio, C. A.: Heuristic and exact methods for the cutting sequencing problem. European Journal of Operational Research, Vol. 110 (1998) 564\u2013575","journal-title":"European Journal of Operational Research"},{"key":"30_CR15","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1016\/0377-2217(95)00025-L","volume":"84","author":"B.J. Yuen","year":"1995","unstructured":"Yuen, B.J., Richardson, K.V.: Establishing the optimality of sequencing heuristics for cutting stock problems. European Journal of Operational Research, Vol. 84 (1995) 590\u2013598","journal-title":"European Journal of Operational Research"}],"container-title":["Lecture Notes in Computer Science","Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36127-8_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T19:25:20Z","timestamp":1556738720000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36127-8_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540001249","9783540361275"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-36127-8_30","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}