{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T20:22:53Z","timestamp":1760646173719,"version":"3.40.3"},"publisher-location":"Cham","reference-count":7,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319051697"},{"type":"electronic","value":"9783319051703"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[[2014]]},"DOI":"10.1007\/978-3-319-05170-3_35","type":"book-chapter","created":{"date-parts":[[2014,3,26]],"date-time":"2014-03-26T13:53:08Z","timestamp":1395841988000},"page":"509-517","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A New Integer Linear Programming Model for the Cutwidth Minimization Problem of a Connected Undirected Graph"],"prefix":"10.1007","author":[{"given":"Mario C.","family":"L\u00f3pez-Loc\u00e9s","sequence":"first","affiliation":[]},{"given":"Norberto","family":"Castillo-Garc\u00eda","sequence":"additional","affiliation":[]},{"given":"H\u00e9ctor J. Fraire","family":"Huacuja","sequence":"additional","affiliation":[]},{"given":"Pascal","family":"Bouvry","sequence":"additional","affiliation":[]},{"given":"Johnatan E.","family":"Pecero","sequence":"additional","affiliation":[]},{"given":"Rodolfo A.","family":"Pazos Rangel","sequence":"additional","affiliation":[]},{"given":"Juan J. G.","family":"Barbosa","sequence":"additional","affiliation":[]},{"given":"Fevrier","family":"Valdez","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,3,27]]},"reference":[{"issue":"3","key":"35_CR1","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"M Garey","year":"1976","unstructured":"Garey, M., Johnson, L.: Some simplified NP-complete graph problems. Theoret. Comput. Sci. 1(3), 237\u2013267 (1976)","journal-title":"Theoret. Comput. Sci."},{"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. Surv. (CSUR) 34(3), 313\u2013356 (2002)","journal-title":"ACM. Comput. Surv. (CSUR)"},{"key":"35_CR3","unstructured":"Andrade, D.V., Resende, M.G.C.: GRASP with path-relinking for network migration scheduling. In: Proceedings of the International Network Optimization Conference (INOC 2007), Citeseer, (2007)"},{"key":"35_CR4","unstructured":"Luttamaguzi, J., Pelsmajer, M., Shen, Z., Yang, B.: Integer programming solutions for several optimization problems in graph theory, In: 20th International Conference on Computers and Their Applications (CATA 2005), 2005"},{"key":"35_CR5","first-page":"17","volume":"4","author":"R Fortet","year":"1960","unstructured":"Fortet, R.: Applications de l\u2019alg\u00e9bre de boole en recherche op\u00e9rationnelle. Rev. Fr. de Rech. Op\u00e9rationelle 4, 17\u201326 (1960)","journal-title":"Rev. Fr. de Rech. Op\u00e9rationelle"},{"key":"35_CR6","doi-asserted-by":"crossref","unstructured":"Chen, D.-S., Batson, R.G., Dang, Y.: Applied Integer Programming: Modeling and Solution. Wiley, (2010)","DOI":"10.1002\/9781118166000"},{"issue":"1","key":"35_CR7","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.cor.2012.05.016","volume":"40","author":"R Mart\u00ed","year":"2013","unstructured":"Mart\u00ed, R., Pantrigo, J.J., Duarte, A., Pardo, E.G.: Branch and bound for the cutwidth minimization problem. Comput. Oper. Res. 40(1), 137\u2013149 (2013)","journal-title":"Comput. Oper. Res."}],"container-title":["Studies in Computational Intelligence","Recent Advances on Hybrid Approaches for Designing Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-05170-3_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,7]],"date-time":"2023-02-07T22:26:20Z","timestamp":1675808780000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-05170-3_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319051697","9783319051703"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-05170-3_35","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"27 March 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}