{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:30:10Z","timestamp":1761611410806},"publisher-location":"Cham","reference-count":21,"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_44","type":"book-chapter","created":{"date-parts":[[2016,12,9]],"date-time":"2016-12-09T04:14:00Z","timestamp":1481256840000},"page":"673-686","source":"Crossref","is-referenced-by-count":2,"title":["Integer Linear Programming Formulation and Exact Algorithm for Computing Pathwidth"],"prefix":"10.1007","author":[{"given":"H\u00e9ctor J.","family":"Fraire-Huacuja","sequence":"first","affiliation":[]},{"given":"Norberto","family":"Castillo-Garc\u00eda","sequence":"additional","affiliation":[]},{"given":"Mario C.","family":"L\u00f3pez-Loc\u00e9s","sequence":"additional","affiliation":[]},{"given":"Jos\u00e9 A.","family":"Mart\u00ednez Flores","sequence":"additional","affiliation":[]},{"given":"Rodolfo A.","family":"Pazos R.","sequence":"additional","affiliation":[]},{"given":"Juan Javier","family":"Gonz\u00e1lez Barbosa","sequence":"additional","affiliation":[]},{"given":"Juan M.","family":"Carpio Valadez","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,12,10]]},"reference":[{"key":"44_CR1","doi-asserted-by":"crossref","unstructured":"D\u00edaz, J., Petit, J., & Serna, M. (2002). A survey of graph layout problems. ACM Computing Surveys (CSUR),\u00a034(3), 313\u2013356.","DOI":"10.1145\/568522.568523"},{"key":"44_CR2","doi-asserted-by":"crossref","unstructured":"Lengauer, T. (1981). Black-white pebbles and graph separation.\u00a0Acta Informatica,\u00a016(4), 465\u2013475.","DOI":"10.1007\/BF00264496"},{"key":"44_CR3","doi-asserted-by":"crossref","unstructured":"Leiserson, C. E. (1980, October). Area-efficient graph layouts. In\u00a0Foundations of Computer Science, 1980, 21st Annual Symposium on\u00a0(pp. 270\u2013281). IEEE.","DOI":"10.1109\/SFCS.1980.13"},{"key":"44_CR4","doi-asserted-by":"crossref","unstructured":"Linhares, A., & Yanasse, H. H. (2002). Connections between cutting-pattern sequencing, VLSI design, and flexible machines.\u00a0Computers & Operations Research,\u00a029(12), 1759\u20131772.","DOI":"10.1016\/S0305-0548(01)00054-5"},{"key":"44_CR5","doi-asserted-by":"crossref","unstructured":"De Oliveira, A., & Lorena, L. A. (2002). A constructive genetic algorithm for gate matrix layout problems.\u00a0Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on,\u00a021(8), 969\u2013974.","DOI":"10.1109\/TCAD.2002.800454"},{"key":"44_CR6","unstructured":"Bodlaender, H., Gustedt, J., & Telle, J. A. (1998, January). Linear-time register allocation for a fixed number of registers. In\u00a0SODA\u00a0(Vol. 98, pp. 574\u2013583)."},{"key":"44_CR7","doi-asserted-by":"crossref","unstructured":"Kornai, A., & Tuza, Z. (1992). Narrowness, pathwidth, and their application in natural language processing.\u00a0Discrete Applied Mathematics,\u00a036(1), 87\u201392.","DOI":"10.1016\/0166-218X(92)90208-R"},{"key":"44_CR8","unstructured":"Lopes, I. C., & Carvalho, J. M. (2010). Minimization of open orders using interval graphs.\u00a0International Journal of Applied Mathematics,\u00a040."},{"key":"44_CR9","unstructured":"Dinneen, M. J. (1996).\u00a0VLSI Layouts and DNA physical mappings. Technical Report, Los Alamos National Laboratory."},{"key":"44_CR10","doi-asserted-by":"crossref","unstructured":"Bollob\u00e1s, B., & Leader, I. (1991). Edge-isoperimetric inequalities in the grid. Combinatorica,\u00a011(4), 299\u2013314.","DOI":"10.1007\/BF01275667"},{"key":"44_CR11","doi-asserted-by":"crossref","unstructured":"Castillo-Garc\u00eda, N., Huacuja, H. J. F., Rangel, R. A. P., Flores, J. A. M., Barbosa, J. J. G., & Valadez, J. M. C. (2014). 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(pp. 519\u2013532). Springer International Publishing.","DOI":"10.1007\/978-3-319-05170-3_36"},{"key":"44_CR12","doi-asserted-by":"crossref","unstructured":"Ellis, J. A., Sudborough, I. H., & Turner, J. S. (1994). The vertex separation and search number of a graph.\u00a0Information and Computation,\u00a0113(1), 50\u201379.","DOI":"10.1006\/inco.1994.1064"},{"key":"44_CR13","doi-asserted-by":"crossref","unstructured":"Skodinis, K. (2000).\u00a0Computing optimal linear layouts of trees in linear time\u00a0(pp. 403\u2013414). Springer Berlin Heidelberg.","DOI":"10.1007\/3-540-45253-2_37"},{"key":"44_CR14","doi-asserted-by":"crossref","unstructured":"Bodlaender, H. L., & M\u00f6hring, R. H. (1993). The pathwidth and treewidth of cographs.\u00a0SIAM Journal on Discrete Mathematics,\u00a06(2), 181\u2013188.","DOI":"10.1137\/0406014"},{"key":"44_CR15","doi-asserted-by":"crossref","unstructured":"Bodlaender, H. L., Kloks, T., & Kratsch, D. (1995). Treewidth and pathwidth of permutation graphs.\u00a0SIAM Journal on Discrete Mathematics,\u00a08(4), 606\u2013616.","DOI":"10.1137\/S089548019223992X"},{"key":"44_CR16","doi-asserted-by":"crossref","unstructured":"Duarte, A., Escudero, L. F., Mart\u00ed, R., Mladenovic, N., Pantrigo, J. J., & S\u00e1nchez-Oro, J. (2012). Variable neighborhood search for the vertex separation problem.\u00a0Computers & Operations Research,\u00a039(12), 3247\u20133255.","DOI":"10.1016\/j.cor.2012.04.017"},{"key":"44_CR17","doi-asserted-by":"crossref","unstructured":"S\u00e1nchez-Oro, J., Pantrigo, J. J., & Duarte, A. (2014). Combining intensification and diversification strategies in VNS. An application to the Vertex Separation problem.\u00a0Computers & Operations Research,\u00a052, 209\u2013219.","DOI":"10.1016\/j.cor.2013.11.008"},{"key":"44_CR18","doi-asserted-by":"crossref","unstructured":"Kinnersley, N. G. (1992). The vertex separation number of a graph equals its path-width.\u00a0Information Processing Letters,\u00a042(6), 345\u2013350.","DOI":"10.1016\/0020-0190(92)90234-M"},{"key":"44_CR19","unstructured":"Cohen, N., & Coudert, D. (2010). Integer linear programming formulation and enumerative algorithm for computing the vertex separation number. http:\/\/sagemanifolds.obspm.fr\/preview\/reference\/graphs\/sage\/graphs\/graph_decompositions\/vertex_separation.html ."},{"key":"44_CR20","doi-asserted-by":"crossref","unstructured":"Suchan, K., & Villanger, Y. (2009). Computing pathwidth faster than 2 n . In Parameterized and Exact Computation\u00a0(pp. 324\u2013335). Springer Berlin Heidelberg.","DOI":"10.1007\/978-3-642-11269-0_27"},{"key":"44_CR21","unstructured":"Huacuja, H. F., Castillo-Garc\u00eda, N., Rangel, R. A. P., Flores, J. A. M., Barbosa, J. J. G., & Valadez, J. M. C. (2015). Two New Exact Methods for the Vertex Separation Problem.\u00a0International Journal of Combinatorial Optimization Problems and Informatics,\u00a06(1), 31\u201341."}],"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_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,16]],"date-time":"2019-09-16T06:48:28Z","timestamp":1568616508000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-47054-2_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,10]]},"ISBN":["9783319470535","9783319470542"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-47054-2_44","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]]}}}