{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T08:39:19Z","timestamp":1758271159252,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319177465"},{"type":"electronic","value":"9783319177472"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-17747-2_35","type":"book-chapter","created":{"date-parts":[[2015,6,12]],"date-time":"2015-06-12T08:42:57Z","timestamp":1434098577000},"page":"465-474","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Comparative Study on Constructive Heuristics for the Vertex Separation Problem"],"prefix":"10.1007","author":[{"given":"Norberto","family":"Castillo-Garc\u00eda","sequence":"first","affiliation":[]},{"given":"H\u00e9ctor Joaqu\u00edn Fraire","family":"Huacuja","sequence":"additional","affiliation":[]},{"given":"Jos\u00e9 Antonio Mart\u00ednez","family":"Flores","sequence":"additional","affiliation":[]},{"given":"Rodolfo A.","family":"Pazos Rangel","sequence":"additional","affiliation":[]},{"given":"Juan Javier Gonz\u00e1lez","family":"Barbosa","sequence":"additional","affiliation":[]},{"given":"Juan Mart\u00edn Carpio","family":"Valadez","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,13]]},"reference":[{"issue":"12","key":"35_CR1","doi-asserted-by":"publisher","first-page":"3247","DOI":"10.1016\/j.cor.2012.04.017","volume":"39","author":"A Duarte","year":"2012","unstructured":"Duarte, A., Escudero, L., Mart\u00ed, R., Mladenovic, N., Pantrigo, J., S\u00e1nchez-Oro, J.: Variable neighborhood search for the vertex separation problem. Comput. Oper. Res. 39(12), 3247\u20133255 (2012)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"35_CR2","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1145\/568522.568523","volume":"34","author":"J D\u00edaz","year":"2002","unstructured":"D\u00edaz, J., Petit, J., Serna, M.: A survey of graph layout problems. ACM Comput. Suv. 34(3), 313\u2013356 (2002)","journal-title":"ACM Comput. Suv."},{"key":"35_CR3","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/BF00264496","volume":"16","author":"T Lengauer","year":"1981","unstructured":"Lengauer, T.: Black-white pebbles and graph separation. Acta Informatica 16, 465\u2013475 (1981)","journal-title":"Acta Informatica"},{"issue":"1","key":"35_CR4","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1006\/jagm.2000.1149","volume":"39","author":"J D\u00edaz","year":"2001","unstructured":"D\u00edaz, J., Penrose, M.D., Petit, J., Serna, M.: Approximating layout problems on random geometric graphs. J. Algorithms 39(1), 78\u2013116 (2001)","journal-title":"J. Algorithms"},{"issue":"1","key":"35_CR5","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1089\/cmb.1995.2.139","volume":"2","author":"PW Goldberg","year":"1995","unstructured":"Goldberg, P.W., Golumbic, M.C., Kaplan, H., Shamir, R.: Four strikes against physical mapping of DNA. J. Comput. Biol. 2(1), 139\u2013152 (1995)","journal-title":"J. Comput. Biol."},{"doi-asserted-by":"crossref","unstructured":"Gusted, J.: On the path width of chordal graphs. Discrete Appl. Math. 45(3), 233\u2013248 (1993)","key":"35_CR6","DOI":"10.1016\/0166-218X(93)90012-D"},{"issue":"1\u20133","key":"35_CR7","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0304-3975(88)90028-X","volume":"58","author":"B Monien","year":"1988","unstructured":"Monien, B., Sudborough, I.H.: Min cut is np-complete for edge weighted trees. Theor. Comput. Sci. 58(1\u20133), 209\u2013229 (1988)","journal-title":"Theor. Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"Leiserson, C.: Area-efficient graph layouts (for VLSI). In: Proceedings of IEEE Symposium on Foundations of Computer Science, pp. 270\u2013281 (1980)","key":"35_CR8","DOI":"10.1109\/SFCS.1980.13"},{"unstructured":"Bodlaender, H., Gustedt, J., Telle, J.: Linear time register allocation for a fixed number of registers. In: Proceedings of the Symposium on Discrete Algorithms (1998)","key":"35_CR9"},{"doi-asserted-by":"crossref","unstructured":"Kornai, A.: Narrowness, path-width, and their application in natural language processing. Discrete Appl. Math. 36, 87\u201392 (1997). (Elsevier Science Publishers B. V. (1992))","key":"35_CR10","DOI":"10.1016\/0166-218X(92)90208-R"},{"issue":"4","key":"35_CR11","first-page":"297","volume":"40","author":"I Lopes","year":"2010","unstructured":"Lopes, I., de Carvalho, J.: Minimization of open orders using interval graphs. IAENG Int. J. Appl. Math. 40(4), 297\u2013306 (2010)","journal-title":"IAENG Int. J. Appl. Math."},{"issue":"2","key":"35_CR12","doi-asserted-by":"publisher","first-page":"98","DOI":"10.5019\/j.ijcir.2005.28","volume":"1","author":"G Luque","year":"2005","unstructured":"Luque, G., Alba, E.: Metaheuristics for the DNA fragment assembly problem. Int. J. Comput. Intell. Res. 1(2), 98\u2013108 (2005)","journal-title":"Int. J. Comput. Intell. Res."},{"doi-asserted-by":"crossref","unstructured":"S\u00e1nchez-Oro, J., Pantrigo, J., Duarte, A.: Combining intensification and diversification strategies in VNS. An application to the Vertex separation problem. Comput. Oper. Res. 52(part B), 209\u2013219 (2013)","key":"35_CR13","DOI":"10.1016\/j.cor.2013.11.008"},{"unstructured":"VSPLIB 2012. Home page: http:\/\/www.optsicom.es\/vsp\/","key":"35_CR14"},{"issue":"1","key":"35_CR15","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/s10479-011-0907-2","volume":"199","author":"JJ Pantrigo","year":"2012","unstructured":"Pantrigo, J.J., Mart\u00ed, R., Duarte, A., Pardo, E.G.: 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","Design of Intelligent Systems Based on Fuzzy Logic, Neural Networks and Nature-Inspired Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-17747-2_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T17:54:00Z","timestamp":1675274040000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-17747-2_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319177465","9783319177472"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-17747-2_35","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"13 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}