{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:24:43Z","timestamp":1740122683315,"version":"3.37.3"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,7,15]],"date-time":"2019-07-15T00:00:00Z","timestamp":1563148800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,7,15]],"date-time":"2019-07-15T00:00:00Z","timestamp":1563148800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003141","name":"Consejo Nacional de Ciencia y Tecnolog\u00eda","doi-asserted-by":"publisher","award":["72282"],"award-info":[{"award-number":["72282"]}],"id":[{"id":"10.13039\/501100003141","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003141","name":"Consejo Nacional de Ciencia y Tecnolog\u00eda","doi-asserted-by":"crossref","award":["SNI-70157"],"award-info":[{"award-number":["SNI-70157"]}],"id":[{"id":"10.13039\/501100003141","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s10589-019-00119-4","type":"journal-article","created":{"date-parts":[[2019,7,15]],"date-time":"2019-07-15T18:04:40Z","timestamp":1563213880000},"page":"895-918","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Two new integer linear programming formulations for the vertex bisection problem"],"prefix":"10.1007","volume":"74","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6474-8016","authenticated-orcid":false,"given":"Norberto","family":"Castillo-Garc\u00eda","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4935-7513","authenticated-orcid":false,"given":"Paula","family":"Hern\u00e1ndez Hern\u00e1ndez","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,15]]},"reference":[{"issue":"3","key":"119_CR1","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. 34(3), 313\u2013356 (2002)","journal-title":"ACM Comput. Surv."},{"issue":"2","key":"119_CR2","doi-asserted-by":"publisher","first-page":"119","DOI":"10.7155\/jgaa.00179","volume":"13","author":"UBD Fleischer","year":"2009","unstructured":"Fleischer, U.B.D.: Vertex bisection is hard, too. J. Graph Algorithms Appl. 13(2), 119\u2013131 (2009)","journal-title":"J. Graph Algorithms Appl."},{"key":"119_CR3","doi-asserted-by":"crossref","unstructured":"Fraire, H., Ter\u00e1n-Villanueva, J.D., Castillo-Garc\u00eda, N., Gonz\u00e1lez\u00a0Barbosa, J.J., Rodr\u00edguez\u00a0del \u00c1ngel, E., G\u00f3mez\u00a0Rojas, Y.: Exact methods for the vertex bisection problem. In: Recent Advances on Hybrid Approaches for Designing Intelligent Systems, pp. 567\u2013577. Springer (2014)","DOI":"10.1007\/978-3-319-05170-3_40"},{"issue":"1","key":"119_CR4","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s10589-017-9945-2","volume":"69","author":"WW Hager","year":"2018","unstructured":"Hager, W.W., Hungerford, J.T., Safro, I.: A multilevel bilinear programming algorithm for the vertex separator problem. Comput. Optim. Appl. 69(1), 189\u2013223 (2018)","journal-title":"Comput. Optim. Appl."},{"issue":"4","key":"119_CR5","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1137\/S0895480199335829","volume":"12","author":"WW Hager","year":"1999","unstructured":"Hager, W.W., Krylyuk, Y.: Graph partitioning and continuous quadratic programming. SIAM J. Discrete Math. 12(4), 500\u2013523 (1999)","journal-title":"SIAM J. Discrete Math."},{"key":"119_CR6","doi-asserted-by":"crossref","unstructured":"Jain, P., Saran, G., Srivastava, K.: Branch and bound algorithm for vertex bisection minimization problem. In: Advanced Computing and Communication Technologies, pp. 17\u201323. Springer (2016)","DOI":"10.1007\/978-981-10-1023-1_2"},{"key":"119_CR7","first-page":"69","volume":"10","author":"P Jain","year":"2016","unstructured":"Jain, P., Saran, G., Srivastava, K.: A new integer linear programming and quadratically constrained quadratic programming formulation for vertex bisection minimization problem. J. Autom. Mobile Robot. Intell. Syst. 10, 69\u201373 (2016)","journal-title":"J. Autom. Mobile Robot. Intell. Syst."},{"key":"119_CR8","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1016\/j.ins.2016.07.055","volume":"369","author":"P Jain","year":"2016","unstructured":"Jain, P., Saran, G., Srivastava, K.: On minimizing vertex bisection using a memetic algorithm. Inf. Sci. 369, 765\u2013787 (2016)","journal-title":"Inf. Sci."},{"key":"119_CR9","doi-asserted-by":"crossref","unstructured":"Karpinski, M.: Approximability of the minimum bisection problem: an algorithmic challenge. In: International Symposium on Mathematical Foundations of Computer Science, pp. 59\u201367. Springer (2002)","DOI":"10.1007\/3-540-45687-2_4"},{"issue":"1\u20133","key":"119_CR10","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/S0166-218X(97)00112-1","volume":"83","author":"R Klasing","year":"1998","unstructured":"Klasing, R.: The relationship between the gossip complexity in vertex-disjoint paths mode and the vertex bisection width. Discrete Appl. Math. 83(1\u20133), 229\u2013246 (1998)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"119_CR11","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/s10589-017-9943-4","volume":"69","author":"F Rendl","year":"2018","unstructured":"Rendl, F., Sotirov, R.: The min-cut and vertex separator problem. Comput. Optim. Appl. 69(1), 159\u2013187 (2018)","journal-title":"Comput. Optim. Appl."},{"key":"119_CR12","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.cor.2013.11.008","volume":"52","author":"Jes\u00fas S\u00e1nchez-Oro","year":"2014","unstructured":"S\u00e1nchez-Oro, J., Pantrigo, J.J.,, Duarte, A.: Combining intensification and diversification strategies in VNS. An application to the vertex separation problem. Comput. Oper. Res. 52, 209\u2013219 (2014)","journal-title":"Computers & Operations Research"},{"key":"119_CR13","unstructured":"Software, R.: \nhttp:\/\/www.r-project.org\/\n\n. The R Project for Statistical Computing. Version 3.4.0. (2017)"},{"issue":"6","key":"119_CR14","doi-asserted-by":"publisher","first-page":"80","DOI":"10.2307\/3001968","volume":"1","author":"F Wilcoxon","year":"1945","unstructured":"Wilcoxon, F.: Individual comparisons by ranking methods. Biom. Bull. 1(6), 80\u201383 (1945)","journal-title":"Biom. Bull."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00119-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-019-00119-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00119-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,13]],"date-time":"2020-07-13T23:32:17Z","timestamp":1594683137000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-019-00119-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,15]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["119"],"URL":"https:\/\/doi.org\/10.1007\/s10589-019-00119-4","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2019,7,15]]},"assertion":[{"value":"17 September 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 July 2019","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}