{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T03:34:03Z","timestamp":1725939243801},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319710075"},{"type":"electronic","value":"9783319710082"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-71008-2_35","type":"book-chapter","created":{"date-parts":[[2018,1,10]],"date-time":"2018-01-10T08:03:15Z","timestamp":1515571395000},"page":"487-500","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A New Heuristic Algorithm for the Vertex Separation Problem"],"prefix":"10.1007","author":[{"given":"Norberto","family":"Castillo-Garc\u00eda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paula","family":"Hern\u00e1ndez Hern\u00e1ndez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,1,11]]},"reference":[{"issue":"3","key":"35_CR1","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1145\/568522.568523","volume":"34","author":"J D\u00edaz","year":"2002","unstructured":"J. D\u00edaz, J. Petit, M. Serna, A survey of graph layout problems. ACM Comput. Surv. (CSUR) 34(3), 313\u2013356 (2002)","journal-title":"ACM Comput. Surv. (CSUR)"},{"issue":"4","key":"35_CR2","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1007\/BF00264496","volume":"16","author":"T Lengauer","year":"1981","unstructured":"T. Lengauer, Black-white pebbles and graph separation. Acta Informatica 16(4), 465\u2013475 (1981)","journal-title":"Acta Informatica"},{"key":"35_CR3","doi-asserted-by":"crossref","unstructured":"C.E. Leiserson, Area-efficient graph layouts, in\u00a021st Annual Symposium on\u00a0Foundations of Computer Science, 1980, (IEEE, 1980, October), pp. 270\u2013281","DOI":"10.1109\/SFCS.1980.13"},{"key":"35_CR4","unstructured":"H. Bodlaender, J. Gustedt, J.A. Telle, Linear-time register allocation for a fixed number of registers. In\u00a0SODA,\u00a0vol. 98 (1998, January), pp. 574\u2013583"},{"issue":"1","key":"35_CR5","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0166-218X(92)90208-R","volume":"36","author":"A Kornai","year":"1992","unstructured":"A. Kornai, Z. Tuza, Narrowness, pathwidth, and their application in natural language processing. Discrete Appl. Math. 36(1), 87\u201392 (1992)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"35_CR6","first-page":"297","volume":"40","author":"IC Lopes","year":"2010","unstructured":"I.C. Lopes, J.M. Carvalho, Minimization of open orders using interval graphs. Int. J. Appl. Math. 40(4), 297\u2013306 (2010)","journal-title":"Int. J. Appl. Math."},{"issue":"2","key":"35_CR7","first-page":"98","volume":"1","author":"G Luque","year":"2005","unstructured":"G. Luque, E. Alba, Metaheuristics for the DNA fragment assembly problem. Int. J. Comput. Itell. Res. 1(2), 98\u2013108 (2005)","journal-title":"Int. J. Comput. Itell. Res."},{"key":"35_CR8","doi-asserted-by":"crossref","unstructured":"H.J.F. Huacuja, N. Castillo-Garc\u00eda, Optimization of the Vertex Separation Problem with genetic algorithms. In\u00a0Handbook of Research on Military, Aeronautical, and Maritime Logistics and Operations\u00a0(IGI Global, 2016), pp. 13\u201331","DOI":"10.4018\/978-1-4666-9779-9.ch002"},{"issue":"12","key":"35_CR9","doi-asserted-by":"crossref","first-page":"3247","DOI":"10.1016\/j.cor.2012.04.017","volume":"39","author":"A Duarte","year":"2012","unstructured":"A. Duarte, L.F. Escudero, R. Mart\u00ed, N. Mladenovic, J.J. Pantrigo, J. S\u00e1nchez-Oro, Variable neighborhood search for the Vertex Separation Problem. Comput. Oper. Res. 39(12), 3247\u20133255 (2012)","journal-title":"Comput. Oper. Res."},{"key":"35_CR10","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/j.cor.2013.11.008","volume":"52","author":"J S\u00e1nchez-Oro","year":"2014","unstructured":"J. S\u00e1nchez-Oro, J.J. Pantrigo, A. Duarte, Combining intensification and diversification strategies in VNS. An application to the Vertex Separation Problem. Comput. Oper. Res. 52, 209\u2013219 (2014)","journal-title":"Comput. Oper. Res."},{"key":"35_CR11","doi-asserted-by":"crossref","unstructured":"N. Castillo-Garc\u00eda, H.J.F. Huacuja, R.A.P. Rangel, J.A.M. Flores, J.J.G. Barbosa, J.M.C. Valadez, On the exact solution of VSP for general and structured graphs: models and algorithms, in\u00a0Recent Advances on Hybrid Approaches for Designing Intelligent Systems\u00a0(Springer International Publishing, 2014), pp. 519\u2013532","DOI":"10.1007\/978-3-319-05170-3_36"},{"key":"35_CR12","doi-asserted-by":"crossref","unstructured":"N. Castillo-Garc\u00eda, H.J.F. Huacuja, R.A.P. Rangel, J.A.M. Flores, J.J.G. Barbosa, J.M.C. Valadez, Comparative study on constructive heuristics for the Vertex Separation Problem, in\u00a0Design of Intelligent Systems Based on Fuzzy Logic, Neural Networks and Nature-Inspired Optimization\u00a0(Springer International Publishing, 2015), pp. 465\u2013474","DOI":"10.1007\/978-3-319-17747-2_35"},{"issue":"1","key":"35_CR13","first-page":"31","volume":"6","author":"H Fraire Huacuja","year":"2015","unstructured":"H. Fraire Huacuja, N. Castillo-Garc\u00eda, R.A. Pazos Rangel, J.A. Mart\u00ednez Flores, J.J. Gonz\u00e1lez Barbosa, J.M. Carpio Valadez, Two new exact methods for the Vertex Separation Problem. Int. J. Comb. Optim. Prob. Inform. 6(1), 31\u201341 (2015)","journal-title":"Int. J. Comb. Optim. Prob. Inform."},{"key":"35_CR14","doi-asserted-by":"crossref","unstructured":"H.J. Fraire-Huacuja, N. Castillo-Garc\u00eda, M.C. L\u00f3pez-Loc\u00e9s, J.A.M. Flores, J.J.G. Barbosa, J.M.C. Valadez, Integer linear programming formulation and exact algorithm for computing pathwidth, in\u00a0Nature-Inspired Design of Hybrid Intelligent Systems\u00a0(Springer International Publishing, 2017), pp. 673\u2013686","DOI":"10.1007\/978-3-319-47054-2_44"},{"key":"35_CR15","unstructured":"R. Sep\u00falveda, O. Montiel, O. Castillo, P. Melin, Fundamentos de L\u00f3gica Difusa.\u00a0Ediciones ILCSA (2002)"},{"issue":"1","key":"35_CR16","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/s10479-011-0907-2","volume":"199","author":"JJ Pantrigo","year":"2012","unstructured":"J.J. Pantrigo, R. Mart\u00ed, A. Duarte, E.G. Pardo, Scatter search for the cutwidth minimization problem. Ann. Oper. Res. 199(1), 285\u2013304 (2012)","journal-title":"Ann. Oper. Res."}],"container-title":["Studies in Computational Intelligence","Fuzzy Logic Augmentation of Neural and Optimization Algorithms: Theoretical Aspects and Real Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-71008-2_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,9]],"date-time":"2019-10-09T05:50:09Z","timestamp":1570600209000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-71008-2_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319710075","9783319710082"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-71008-2_35","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2018]]}}}