{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T23:46:31Z","timestamp":1762299991035,"version":"3.37.3"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,1,17]],"date-time":"2022-01-17T00:00:00Z","timestamp":1642377600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,17]],"date-time":"2022-01-17T00:00:00Z","timestamp":1642377600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2022,3]]},"DOI":"10.1007\/s10589-021-00334-y","type":"journal-article","created":{"date-parts":[[2022,1,17]],"date-time":"2022-01-17T00:03:47Z","timestamp":1642377827000},"page":"657-687","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["A general variable neighborhood search for the cyclic antibandwidth problem"],"prefix":"10.1007","volume":"81","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5258-5915","authenticated-orcid":false,"given":"Sergio","family":"Cavero","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6247-5269","authenticated-orcid":false,"given":"Eduardo G.","family":"Pardo","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4532-3124","authenticated-orcid":false,"given":"Abraham","family":"Duarte","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,17]]},"reference":[{"issue":"1","key":"334_CR1","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0166-218X(01)00338-9","volume":"123","author":"RK Ahuja","year":"2002","unstructured":"Ahuja, R.K., Ergun, O., Orlin, J.B., Punnen, A.P.: A survey of very large-scale neighborhood search techniques. Discret. Appl. Math. 123(1), 75\u2013102 (2002)","journal-title":"Discret. Appl. Math."},{"issue":"3","key":"334_CR2","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1093\/comjnl\/8.3.264","volume":"8","author":"G Alway","year":"1965","unstructured":"Alway, G., Martin, D.: An algorithm for reducing the bandwidth of a matrix of symmetrical configuration. Comput. J. 8(3), 264\u2013272 (1965)","journal-title":"Comput. J."},{"issue":"2","key":"334_CR3","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/s00500-009-0538-6","volume":"15","author":"R Bansal","year":"2011","unstructured":"Bansal, R., Srivastava, K.: A memetic algorithm for the cyclic antibandwidth maximization problem. Soft. Comput. 15(2), 397\u2013412 (2011)","journal-title":"Soft. Comput."},{"issue":"2","key":"334_CR4","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/0022-0000(84)90071-0","volume":"28","author":"SN Bhatt","year":"1984","unstructured":"Bhatt, S.N., Thomson Leighton, F.: A framework for solving VLSI graph layout problems. J. Comput. Syst. Sci. 28(2), 300\u2013343 (1984)","journal-title":"J. Comput. Syst. Sci."},{"key":"334_CR5","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.cor.2020.105116","volume":"126","author":"S Cavero","year":"2021","unstructured":"Cavero, S., Pardo, E.G., Laguna, M., Duarte, A.: Multistart search for the cyclic cutwidth minimization problem. Comput. Oper. Res. 126, 105\u2013116 (2021)","journal-title":"Comput. Oper. Res."},{"key":"334_CR6","doi-asserted-by":"crossref","unstructured":"Dobrev, S., Kr\u00e1lovi\u010d, R., Pardubsk\u00e1, D., T\u00f6r\u00f6k, L., Vrt\u2019o, I.: Antibandwidth and cyclic antibandwidth of Hamming graphs. Discret. Appl. Math. 161(10), 1402\u20131408 (2013)","DOI":"10.1016\/j.dam.2012.12.026"},{"issue":"12","key":"334_CR7","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.F., Mart\u00ed, R., Mladenovic, N., Pantrigo, J.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":"1","key":"334_CR8","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1093\/imaman\/dpt026","volume":"27","author":"A Duarte","year":"2016","unstructured":"Duarte, A., Pantrigo, J.J., Pardo, E.G., S\u00e1nchez-Oro, J.: Parallel variable neighbourhood search strategies for the cutwidth minimization problem. IMA J. Manag. Math. 27(1), 55\u201373 (2016)","journal-title":"IMA J. Manag. Math."},{"key":"334_CR9","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/978-3-319-07124-4_9","volume-title":"Handbook of Heuristics","author":"A Duarte","year":"2018","unstructured":"Duarte, A., S\u00e1nchez-Oro, J., Mladenovi\u0107, N., Todosijevi\u0107, R.: Variable Neighborhood Descent. In: Mart\u00ed, R., Pardalos, P.M., Resende, M.G.C. (eds.) Handbook of Heuristics, pp. 341\u2013367. Springer, Cham (2018)"},{"key":"334_CR10","volume-title":"Users Guide for the Harwell\u2013Boeing Sparse Matrix Collection (Release I)","author":"IS Duff","year":"1992","unstructured":"Duff, I.S., Grimes, R.G., Lewis, J.G.: Users Guide for the Harwell\u2013Boeing Sparse Matrix Collection (Release I). RAL, Chilton (1992)"},{"issue":"3","key":"334_CR11","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":"12","key":"334_CR12","doi-asserted-by":"publisher","first-page":"1497","DOI":"10.1109\/PROC.1980.11899","volume":"68","author":"W Hale","year":"1980","unstructured":"Hale, W.: Frequency assignment: theory and applications. Proc. IEEE 68(12), 1497\u20131514 (1980)","journal-title":"Proc. IEEE"},{"key":"334_CR13","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-1-4614-6940-7_12","volume-title":"Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques","author":"P Hansen","year":"2014","unstructured":"Hansen, P., Mladenovi\u0107, N.: Variable Neighborhood Search. In: Burke, E.K., Kendall, G. (eds.) Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques, pp. 313\u2013337. Springer, US, Boston, MA (2014)"},{"issue":"3","key":"334_CR14","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s13675-016-0075-x","volume":"5","author":"P Hansen","year":"2017","unstructured":"Hansen, P., Mladenovi\u0107, N., Todosijevi\u0107, R., Hanafi, S.: Variable neighborhood search: basics and variants. EURO J. Comput. Optim. 5(3), 423\u2013454 (2017)","journal-title":"EURO J. Comput. Optim."},{"issue":"3","key":"334_CR15","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/S0021-9800(66)80059-5","volume":"1","author":"LH Harper","year":"1966","unstructured":"Harper, L.H.: Optimal numberings and isoperimetric problems on graphs. J. Comb. Theory 1(3), 385\u2013393 (1966)","journal-title":"J. Comb. Theory"},{"issue":"2","key":"334_CR16","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1006\/inco.1995.1068","volume":"118","author":"J Hromkovic","year":"1995","unstructured":"Hromkovic, J., Muller, V., Sykora, O., Vrto, I.: On embeddings in cycles. Inf. Comput. 118(2), 302\u2013305 (1995)","journal-title":"Inf. Comput."},{"issue":"6","key":"334_CR17","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1007\/s10732-016-9319-4","volume":"22","author":"P Jain","year":"2016","unstructured":"Jain, P., Srivastava, K., Saran, G.: Minimizing cyclic cutwidth of graphs using a memetic algorithm. J. Heurist. 22(6), 815\u2013848 (2016)","journal-title":"J. Heurist."},{"issue":"3","key":"334_CR18","doi-asserted-by":"publisher","first-page":"650","DOI":"10.1137\/0213040","volume":"13","author":"JY-T Leung","year":"1984","unstructured":"Leung, J.Y.-T., Vornberger, O., Witthoff, J.D.: On some variants of the bandwidth minimization problem. SIAM J. Comput. 13(3), 650\u2013667 (1984)","journal-title":"SIAM J. Comput."},{"key":"334_CR19","doi-asserted-by":"crossref","unstructured":"L\u00f3pez-Ib\u00e1 nez, M., Dubois-Lacoste, J., P. C\u00e1ceres, L., Birattari, M., St\u00fctzle, T.: Iterated racing for automatic algorithm configuration. The irace package. Oper. Res. Perspect. 3, 43\u201358 (2016)","DOI":"10.1016\/j.orp.2016.09.002"},{"key":"334_CR20","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.knosys.2013.08.026","volume":"54","author":"M Lozano","year":"2013","unstructured":"Lozano, M., Duarte, A., Gort\u00e1zar, F., Mart\u00ed, R.: A hybrid metaheuristic for the cyclic antibandwidth problem. Knowl. Based Syst. 54, 103\u2013113 (2013)","journal-title":"Knowl. Based Syst."},{"key":"334_CR21","doi-asserted-by":"crossref","unstructured":"Mart\u00ed, R.: Multi-start methods. In: Handbook of Metaheuristics. International Series in Operations Research and Management Science, pp. 355\u2013368. Springer, Boston (2003)","DOI":"10.1007\/0-306-48056-5_12"},{"issue":"2","key":"334_CR22","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1016\/S0377-2217(00)00325-8","volume":"135","author":"R Mart\u00ed","year":"2001","unstructured":"Mart\u00ed, R., Laguna, M., Glover, F., Campos, V.: Reducing the bandwidth of a sparse matrix with tabu search. Eur. J. Oper. Res. 135(2), 450\u2013459 (2001)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"334_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4018\/jsir.2011040101","volume":"2","author":"R Mart\u00ed","year":"2011","unstructured":"Mart\u00ed, R., Pantrigo, J.-J., Duarte, A., Campos, V., Glover, F.: Scatter search and path relinking\u202f: a tutorial on the linear arrangement problem. Int. J. Swarm Intell. Res. (IJSIR) 2(2), 1\u201321 (2011)","journal-title":"Int. J. Swarm Intell. Res. (IJSIR)"},{"issue":"6","key":"334_CR24","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1002\/net.3230190604","volume":"19","author":"Z Miller","year":"1989","unstructured":"Miller, Z., Pritikin, D.: On the separation number of a graph. Networks 19(6), 651\u2013666 (1989)","journal-title":"Networks"},{"issue":"3","key":"334_CR25","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1016\/j.ejor.2006.12.064","volume":"191","author":"N Mladenovi\u0107","year":"2008","unstructured":"Mladenovi\u0107, N., Dra\u017ei\u0107, M., Kova\u010devic-Vuj\u010di\u0107, V., \u010cangalovi\u0107, M.: General variable neighborhood search for the continuous optimization. Eur. J. Oper. Res. 191(3), 753\u2013770 (2008)","journal-title":"Eur. J. Oper. Res."},{"issue":"11","key":"334_CR26","doi-asserted-by":"publisher","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(11), 1097\u20131100 (1997)","journal-title":"Comput. Oper. Res."},{"key":"334_CR27","first-page":"1","volume-title":"Handbook of Heuristics","author":"EG Pardo","year":"2016","unstructured":"Pardo, E.G., Mart\u00ed, R., Duarte, A.: Linear Layout Problems. In: Mart\u00ed, R., Panos, P., Resende, M.G. (eds.) Handbook of Heuristics, pp. 1\u201325. Springer, Cham (2016)"},{"issue":"5","key":"334_CR28","doi-asserted-by":"publisher","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(5), 2242\u20132252 (2013)","journal-title":"Appl. Soft Comput."},{"issue":"2","key":"334_CR29","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/s10878-013-9604-1","volume":"29","author":"EG Pardo","year":"2015","unstructured":"Pardo, E.G., Soto, M., Thraves, C.: Embedding signed graphs in the line. J. Comb. Optim. 29(2), 451\u2013471 (2015)","journal-title":"J. Comb. Optim."},{"key":"334_CR30","doi-asserted-by":"publisher","first-page":"104830","DOI":"10.1016\/j.cor.2019.104830","volume":"114","author":"T Pastore","year":"2020","unstructured":"Pastore, T., Mart\u00ednez-Gavara, A., Napoletano, A., Festa, P., Mart\u00ed, R.: Tabu search for min-max edge crossing in graphs. Comput. Oper. Res. 114, 104830 (2020)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"334_CR31","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/S0377-2217(02)00715-4","volume":"153","author":"E Pi\u00f1ana","year":"2004","unstructured":"Pi\u00f1ana, E., Plana, I., Campos, V., Mart\u00ed, R.: GRASP and path relinking for the matrix bandwidth minimization. Eur. J. Oper. Res. 153(1), 200\u2013210 (2004)","journal-title":"Eur. J. Oper. Res."},{"key":"334_CR32","doi-asserted-by":"crossref","unstructured":"Raspaud, A., Schr\u00f6der, H., S\u00fdkora, O., Torok, L., Vrt\u2019o, I.: Antibandwidth and cyclic antibandwidth of meshes and hypercubes. Discret. Math. 309(11), 3541\u20133552 (2009)","DOI":"10.1016\/j.disc.2007.12.058"},{"key":"334_CR33","unstructured":"Raspaud, A., S\u00fdkora, O., Vrt\u2019o, I.: Congestion and dilation, similarities and differences: a survey. In: Proceedings of the 7th International Colloquium on Structural Information and Communication Complexity, pp. 14 (2000)"},{"key":"334_CR34","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.knosys.2020.106136","volume":"203","author":"J Ren","year":"2020","unstructured":"Ren, J., Hao, J.-K., Rodriguez-Tello, E., Li, L., He, K.: A new iterated local search algorithm for the cyclic bandwidth problem. Knowl. Based Syst. 203, 106\u2013136 (2020)","journal-title":"Knowl. Based Syst."},{"issue":"10","key":"334_CR35","doi-asserted-by":"publisher","first-page":"3331","DOI":"10.1016\/j.cor.2007.03.001","volume":"35","author":"E Rodriguez-Tello","year":"2008","unstructured":"Rodriguez-Tello, E., Hao, J.-K., Torres-Jimenez, J.: An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem. Comput. Oper. Res. 35(10), 3331\u20133346 (2008)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"334_CR36","doi-asserted-by":"publisher","first-page":"904","DOI":"10.1016\/j.ejor.2018.09.031","volume":"273","author":"E Rodriguez-Tello","year":"2019","unstructured":"Rodriguez-Tello, E., Lardeux, F., Duarte, A., Narvaez-Teran, V.: Alternative evaluation functions for the cyclic bandwidth sum problem. Eur. J. Oper. Res. 273(3), 904\u2013919 (2019)","journal-title":"Eur. J. Oper. Res."},{"key":"334_CR37","doi-asserted-by":"publisher","first-page":"40258","DOI":"10.1109\/ACCESS.2019.2906840","volume":"7","author":"E Rodriguez-Tello","year":"2019","unstructured":"Rodriguez-Tello, E., Narvaez-Teran, V., Lardeux, F.: Dynamic multi-armed bandit algorithm for the cyclic bandwidth sum problem. IEEE Access 7, 40258\u201340270 (2019)","journal-title":"IEEE Access"},{"key":"334_CR38","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.cor.2014.11.013","volume":"57","author":"E Rodriguez-Tello","year":"2015","unstructured":"Rodriguez-Tello, E., Romero-Monsivais, H., Ramirez-Torres, G., Lardeux, F.: Tabu search for the cyclic bandwidth problem. Comput. Oper. Res. 57, 17\u201332 (2015)","journal-title":"Comput. Oper. Res."},{"key":"334_CR39","doi-asserted-by":"crossref","unstructured":"Rost, M., Schmid, S.: Charting the complexity landscape of virtual network embeddings. In: 2018 IFIP Networking Conference (IFIP Networking) and Workshops, pp. 1\u20139 (2018)","DOI":"10.23919\/IFIPNetworking.2018.8696604"},{"key":"334_CR40","series-title":"In The Algorithm Design Manual","volume-title":"Graph Traversal","author":"SS Skiena","year":"1997","unstructured":"Skiena, S.S.: Graph Traversal. In The Algorithm Design Manual, 2nd edn. Springer Publishing Company, Berlin (1997)","edition":"2"},{"key":"334_CR41","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.cor.2013.11.008","volume":"52","author":"J S\u00e1nchez-Oro","year":"2014","unstructured":"S\u00e1nchez-Oro, J., Jos\u00e9 Pantrigo, 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":"Comput. Oper. Res."},{"key":"334_CR42","doi-asserted-by":"crossref","unstructured":"S\u00fdkora, O., Torok, L., Vrt\u2019o, I.: The cyclic antibandwidth problem. Electr. Notes Discrete Math. 22, 223\u2013227 (2005)","DOI":"10.1016\/j.endm.2005.06.030"},{"issue":"3","key":"334_CR43","first-page":"16","volume":"35","author":"Y Weili","year":"2003","unstructured":"Weili, Y., Xiaoxu, L., Ju, Z.: Dual bandwidth of some special trees. Journal\u2013Zhengzhou Univ. Nat. Sci. Ed. 35(3), 16\u201319 (2003)","journal-title":"Journal\u2013Zhengzhou Univ. Nat. Sci. Ed."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-021-00334-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-021-00334-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-021-00334-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,10]],"date-time":"2022-02-10T15:20:13Z","timestamp":1644506413000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-021-00334-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,17]]},"references-count":43,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["334"],"URL":"https:\/\/doi.org\/10.1007\/s10589-021-00334-y","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2022,1,17]]},"assertion":[{"value":"8 February 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 November 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 January 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}