{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T20:29:31Z","timestamp":1760646571501},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319470535"},{"type":"electronic","value":"9783319470542"}],"license":[{"start":{"date-parts":[[2016,12,10]],"date-time":"2016-12-10T00:00:00Z","timestamp":1481328000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-47054-2_48","type":"book-chapter","created":{"date-parts":[[2016,12,9]],"date-time":"2016-12-09T04:14:00Z","timestamp":1481256840000},"page":"729-738","source":"Crossref","is-referenced-by-count":2,"title":["Solving the Cut Width Optimization Problem with a Genetic Algorithm Approach"],"prefix":"10.1007","author":[{"given":"Hector Joaqu\u00edn","family":"Fraire-Huacuja","sequence":"first","affiliation":[]},{"given":"Mario C\u00e9sar","family":"L\u00f3pez-Loc\u00e9s","sequence":"additional","affiliation":[]},{"given":"Norberto Castillo","family":"Garc\u00eda","sequence":"additional","affiliation":[]},{"given":"Johnatan E.","family":"Pecero","sequence":"additional","affiliation":[]},{"given":"Rodolfo Pazos","family":"Rangel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,12,10]]},"reference":[{"key":"48_CR1","unstructured":"M. R. Garey, D. S. Johnson, and others, Computers and Intractability: A Guide to the Theory of NP-completeness. WH freeman San Francisco, 1979."},{"key":"48_CR2","doi-asserted-by":"crossref","unstructured":"E. Korach and N. Solel, \u201cTree-width, path-width, and cutwidth,\u201d Discret. Appl. Math., vol. 43, no. 1, pp. 97\u2013101, 1993.","DOI":"10.1016\/0166-218X(93)90171-J"},{"key":"48_CR3","doi-asserted-by":"crossref","unstructured":"T. Ohtsuki, H. Mori, E. Kuh, T. Kashiwabara, and T. Fujisawa, \u201cOne-dimensional logic gate assignment and interval graphs,\u201d Circuits Syst. IEEE Trans., vol. 26, no. 9, pp. 675\u2013684, 1979.","DOI":"10.1109\/TCS.1979.1084695"},{"key":"48_CR4","doi-asserted-by":"crossref","unstructured":"M. Suderman, \u201cPathwidth and layered drawings of trees,\u201d Int. J. Comput. Geom. Appl., vol. 14, no. 03, pp. 203\u2013225, 2004.","DOI":"10.1142\/S0218195904001433"},{"key":"48_CR5","unstructured":"H. Bodlaender, J. Gustedt, and J. A. Telle, \u201cLinear-time register allocation for a fixed number of registers,\u201d in Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms, 1998, pp. 574\u2013583."},{"key":"48_CR6","unstructured":"Z. Tuza, \u201cNarrowness, Path-width, and their Application in Natural Language Processing.\u201d"},{"key":"48_CR7","doi-asserted-by":"crossref","unstructured":"E. Pardo, N. Mladenovi\u0107, J. Pantrigo, and A. Duarte, \u201cVariable formulation search for the cutwidth minimization problem,\u201d Appl. Soft Comput., vol. 13, pp. 2242\u20132252, 2013.","DOI":"10.1016\/j.asoc.2013.01.016"},{"key":"48_CR8","unstructured":"D. Andrade and M. Resende, \u201cGRASP with path-relinking for network migration scheduling,\u201d \u2026 Int. Netw. \u2026, pp. 1\u20137, 2007."},{"key":"48_CR9","unstructured":"D. Andrade and M. Resende, \u201cGRASP with evolutionary path-relinking,\u201d Proc. Seventh Metaheuristics \u2026, pp. 6\u20139, 2007."},{"key":"48_CR10","doi-asserted-by":"crossref","unstructured":"J. J. Pantrigo, R. Mart\u00ed, A. Duarte, and E. G. Pardo, \u201cScatter search for the cutwidth minimization problem,\u201d Ann. Oper. Res., vol. 199, no. 1, pp. 285\u2013304, 2012.","DOI":"10.1007\/s10479-011-0907-2"},{"key":"48_CR11","unstructured":"V. Campos, E. Pi\u00f1ana, and R. Mart\u00ed, \u201cAdaptive memory programming for matrix bandwidth minimization,\u201d Ann. Oper. Res., pp. 1\u201317, 2006."},{"key":"48_CR12","unstructured":"J. H. Holland, Adaptation in Natural and Artificial Systems, vol. Ann Arbor. 1975."},{"key":"48_CR13","doi-asserted-by":"crossref","unstructured":"L. A. Zadeh, \u201cFuzzy sets,\u201d Inf. Control, vol. 8, no. 3, pp. 338\u2013353, Jun. 1965.","DOI":"10.1016\/S0019-9958(65)90241-X"},{"key":"48_CR14","unstructured":"A. Michael and H. Takagi, \u201cDynamic control of genetic algorithms using fuzzy logic techniques,\u201d in Proceedings of the Fifth International Conference on Genetic Algorithms, 1993, pp. 76\u201383."},{"key":"48_CR15","doi-asserted-by":"crossref","unstructured":"F. Valdez, P. Melin, and O. Castillo, \u201cFuzzy control of parameters to dynamically adapt the {PSO} and {GA} Algorithms,\u201d in {FUZZ-IEEE} 2010, {IEEE} International Conference on Fuzzy Systems, Barcelona, Spain, 18-23 July, 2010, Proceedings, 2010, pp. 1\u20138.","DOI":"10.1109\/FUZZY.2010.5583934"},{"key":"48_CR16","doi-asserted-by":"crossref","unstructured":"F. Valdez and P. Melin, \u201cA New Evolutionary Method with Particle Swarm Optimization and Genetic Algorithms Using Fuzzy Systems to Dynamically Parameter Adaptation,\u201d in Soft Computing for Recognition Based on Biometrics, 2010, pp. 225\u2013243.","DOI":"10.1007\/978-3-642-15111-8_14"},{"key":"48_CR17","doi-asserted-by":"crossref","unstructured":"R. Mart\u00ed, J. Pantrigo, A. Duarte, and E. Pardo, \u201cBranch and bound for the cutwidth minimization problem,\u201d Comput. Oper. \u2026, vol. 40, pp. 137\u2013149, 2013.","DOI":"10.1016\/j.cor.2012.05.016"},{"key":"48_CR18","unstructured":"L. Rutkowski, Flexible neuro-fuzzy systems: structures, learning and performance evaluation, vol. 771. Springer Science & Business Media, 2006."},{"key":"48_CR19","unstructured":"D. A. Mart\u00ed R. Pantrigo J.J. and P. E.G., \u201cOptsicom Project.\u201d 2010."}],"container-title":["Studies in Computational Intelligence","Nature-Inspired Design of Hybrid Intelligent Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-47054-2_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,16]],"date-time":"2019-09-16T06:48:43Z","timestamp":1568616523000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-47054-2_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,10]]},"ISBN":["9783319470535","9783319470542"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-47054-2_48","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2016,12,10]]}}}