{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T01:19:55Z","timestamp":1773883195129,"version":"3.50.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2014,9,18]],"date-time":"2014-09-18T00:00:00Z","timestamp":1410998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2017,8]]},"DOI":"10.1007\/s11590-014-0793-z","type":"journal-article","created":{"date-parts":[[2014,9,17]],"date-time":"2014-09-17T13:29:23Z","timestamp":1410960563000},"page":"1069-1089","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["General Variable Neighborhood Search for computing graph separators"],"prefix":"10.1007","volume":"11","author":[{"given":"Jes\u00fas","family":"S\u00e1nchez-Oro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nenad","family":"Mladenovi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abraham","family":"Duarte","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,9,18]]},"reference":[{"key":"793_CR1","doi-asserted-by":"crossref","unstructured":"Arora, S., Rao, S., Vazirani, U.: Expander flows, geometric embeddings, and graph partitionings. In: 36th Annual Symposium on the Theory of Computing, pp. 222\u2013231 (2004)","DOI":"10.1145\/1007352.1007355"},{"key":"793_CR2","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1016\/0022-0000(84)90071-0","volume":"28","author":"SN Bhatt","year":"1984","unstructured":"Bhatt, S.N., Leighton, F.T.: A framework for solving VLSI graph layout problems. J. Comput. Syst. Sci. 28, 300\u2013343 (1984)","journal-title":"J. Comput. Syst. Sci."},{"key":"793_CR3","doi-asserted-by":"crossref","unstructured":"Biha M.D., Meurs, M.J.: An exact algorithm for solving the vertex separator problem. J. Glob. Optim. 49, 425\u2013434 (2011)","DOI":"10.1007\/s10898-010-9568-y"},{"key":"793_CR4","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0020-0190(92)90140-Q","volume":"42","author":"TN Bui","year":"1992","unstructured":"Bui, T.N., Jones, C.: Finding good approximate vertex and edge partitions is NP-hard. Inf. Process. Lett. 42, 153\u2013159 (1992)","journal-title":"Inf. Process. Lett."},{"key":"793_CR5","doi-asserted-by":"crossref","unstructured":"Duarte, A., Escudero, L.F., Mart\u00ed, R., Mladenovi\u0107, N., Pantrigo, J.J., S\u00e1nchez-Oro, J.: Variable neighborhood search for the vertex separation problem. Comput. Oper. Res. 39(12), 3247\u20133255 (2012)","DOI":"10.1016\/j.cor.2012.04.017"},{"key":"793_CR6","unstructured":"Feige, U., Kogan, S.: Hardness of approximation of the balanced complete bipartite subgraph problem. Technical report MCS04-04, Department of Computer Science and Applied Math., The Weizmann Institute of Science (2004)"},{"key":"793_CR7","doi-asserted-by":"crossref","unstructured":"Feige, U., Hajiaghayi, M., Lee, J.R.: Improved approximation algorithms for minimum-weight vertex separators. In: Proceedings of the Thirty-seventh Annual ACM Symposium on Theory of Computing, pp. 563\u2013572 (2005)","DOI":"10.1145\/1060590.1060674"},{"key":"793_CR8","doi-asserted-by":"crossref","unstructured":"Fu, B., Chen, Z.: Sublinear time width-bounded separators and their application to the protein side-chain packing problem. In: Algorithmic Aspects in Information and Management, LNCS, vol. 4041, pp. 149\u2013160 (2006)","DOI":"10.1007\/11775096_15"},{"issue":"1","key":"793_CR9","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/s10479-009-0657-6","volume":"175","author":"P Hansen","year":"2010","unstructured":"Hansen, P., Mladenovi\u0107, N., Moreno, J.A.: Variable neighborhood search: methods and applications. Ann. Oper. Res. 175(1), 367\u2013407 (2010)","journal-title":"Ann. Oper. Res."},{"key":"793_CR10","volume-title":"Complexity Issues in VLSI: Optimal Layout for the Shuffle-Exchange Graph and Other Networks","author":"FT Leighton","year":"1983","unstructured":"Leighton, F.T.: Complexity Issues in VLSI: Optimal Layout for the Shuffle-Exchange Graph and Other Networks. MIT Press, Cambridge (1983)"},{"key":"793_CR11","doi-asserted-by":"crossref","first-page":"787","DOI":"10.1145\/331524.331526","volume":"46","author":"T Leighton","year":"1999","unstructured":"Leighton, T., Rao, S.: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J. ACM 46, 787\u2013832 (1999)","journal-title":"J. ACM"},{"key":"793_CR12","doi-asserted-by":"crossref","unstructured":"Leiserson, C.: Area-efficient graph layouts (for VLSI). In: 21th Annual Symposium on Foundations of Computer Science. IEEE Computer Soc., Los Alamitos, pp. 270\u2013280 (1980)","DOI":"10.1109\/SFCS.1980.13"},{"key":"793_CR13","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1137\/0136016","volume":"36","author":"RJ Lipton","year":"1979","unstructured":"Lipton, R.J., Tarjan, R.J.: A separator theorem for planar graphs. SIAM J. Appl. Math 36, 177\u2013189 (1979)","journal-title":"SIAM J. Appl. Math"},{"key":"793_CR14","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1137\/0209046","volume":"9","author":"RJ Lipton","year":"1980","unstructured":"Lipton, R.J., Tarjan, R.E.: Applications of a planar separator theorem. SIAM J. Comput. 9, 615\u2013627 (1980)","journal-title":"SIAM J. Comput."},{"key":"793_CR15","doi-asserted-by":"crossref","unstructured":"Lozano, M., Duarte, A., Gort\u00e1zar, F., Mart\u00ed, R.: Variable neighborhood search with ejection chains for the antibandwidth problem. J. Heuristics 18, 919\u2013938 (2012)","DOI":"10.1007\/s10732-012-9213-7"},{"key":"793_CR16","doi-asserted-by":"crossref","unstructured":"Mart\u00ed, R., Moreno-Vega, J.M., Duarte, A.: Advanced multi-start methods. In: Gendreau, M., Potvin, J-Y. (eds.) Handbook of Metaheuristics, vol. 146, pp. 265\u2013281. Springer (2010)","DOI":"10.1007\/978-1-4419-1665-5_9"},{"key":"793_CR17","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24, 1097\u20131100 (1997)","journal-title":"Comput. Oper. Res."},{"key":"793_CR18","unstructured":"Montemayor, A.S., Duarte, A., Pantrigo, J.J., Cabido, R.: High-performance VNS for the Max-cut problem using commodity graphics hardware. In: Mini-Euro Conference on VNS (MECVNS 05), Tenerife (Spain), pp. 1\u201311 (2005)"},{"key":"793_CR19","doi-asserted-by":"crossref","first-page":"2242","DOI":"10.1016\/j.asoc.2013.01.016","volume":"13","author":"EG Pardo","year":"2013","unstructured":"Pardo, E.G., Mladenovi\u0107, N., Pantrigo, J.J., Duarte, A.: Variable formulation search for the cutwidth minimization problem. Appl. Soft Comput. 13, 2242\u20132252 (2013)","journal-title":"Appl. Soft Comput."},{"key":"793_CR20","doi-asserted-by":"crossref","unstructured":"S\u00e1nchez-Oro, J., Pantrigo, J.J., Duarte, A.: Balancing intensification and diversification strategies in VNS. An application to the Vertex Separation Problem. Technical Report. Dept. Ciencias de la Computaci\u00f3n. Universidad Rey Juan Carlos (2013)","DOI":"10.1016\/j.cor.2013.11.008"},{"key":"793_CR21","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1007\/s10107-005-0573-8","volume":"103","author":"C Souza de","year":"2005","unstructured":"de Souza, C., Balas, E.: The vertex separator problem: algorithms and computations. Math. Progr. 103, 609\u2013631 (2005)","journal-title":"Math. Progr."},{"key":"793_CR22","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/0-306-48056-5_6","volume":"57","author":"P Hansen","year":"2003","unstructured":"Hansen, P., Mladenovi\u0107, N.: Variable neighborhood search. Int. Ser. Oper. Res. Manag. Sci. 57, 145\u2013184 (2003)","journal-title":"Int. Ser. Oper. Res. Manag. Sci."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-014-0793-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-014-0793-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-014-0793-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-014-0793-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,14]],"date-time":"2019-08-14T23:34:40Z","timestamp":1565825680000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-014-0793-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9,18]]},"references-count":22,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2017,8]]}},"alternative-id":["793"],"URL":"https:\/\/doi.org\/10.1007\/s11590-014-0793-z","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,9,18]]}}}