{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T02:49:14Z","timestamp":1777603754272,"version":"3.51.4"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"5-6","license":[{"start":{"date-parts":[[2022,8,31]],"date-time":"2022-08-31T00:00:00Z","timestamp":1661904000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,8,31]],"date-time":"2022-08-31T00:00:00Z","timestamp":1661904000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["72122006"],"award-info":[{"award-number":["72122006"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1007\/s10732-022-09504-5","type":"journal-article","created":{"date-parts":[[2022,8,31]],"date-time":"2022-08-31T04:04:35Z","timestamp":1661918675000},"page":"583-618","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Breakout local search for the cyclic cutwidth minimization problem"],"prefix":"10.1007","volume":"28","author":[{"given":"Mu","family":"He","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qinghua","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongliang","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,31]]},"reference":[{"key":"9504_CR1","unstructured":"Allmond, H.: On the cyclic cutwidth of complete tripartite and n-partite graphs. CSUSB REU (2006)"},{"key":"9504_CR2","doi-asserted-by":"crossref","unstructured":"Bansal, R., Srivastava, K., Srivastava, S.: A hybrid evolutionary algorithm for the cutwidth minimization problem. In: 2012 IEEE Congress on Evolutionary Computation, pp. 1\u20138. IEEE (2012)","DOI":"10.1109\/CEC.2012.6256549"},{"key":"9504_CR3","doi-asserted-by":"crossref","unstructured":"Benlic, U., Hao, J.-K.: A study of breakout local search for the minimum sum coloring problem. In: Asia-Pacific Conference on Simulated Evolution and Learning, pp. 128\u2013137. Springer (2012)","DOI":"10.1007\/978-3-642-34859-4_13"},{"key":"9504_CR4","doi-asserted-by":"crossref","unstructured":"Benlic, U., Hao, J.-K.: Breakout local search for the vertex separator problem. In: Twenty-Third International Joint Conference on Artificial Intelligence (2013)","DOI":"10.1016\/j.engappai.2012.09.001"},{"issue":"1","key":"9504_CR5","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1016\/j.cor.2012.06.002","volume":"40","author":"U Benlic","year":"2013","unstructured":"Benlic, U., Hao, J.-K.: Breakout local search for maximum clique problems. Comput. Oper. Res. 40(1), 192\u2013206 (2013)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"9504_CR6","doi-asserted-by":"publisher","first-page":"1162","DOI":"10.1016\/j.engappai.2012.09.001","volume":"26","author":"U Benlic","year":"2013","unstructured":"Benlic, U., Hao, J.-K.: Breakout local search for the max-cut problem. Eng. Appl. Artificial Intell. 26(3), 1162\u20131173 (2013)","journal-title":"Eng. Appl. Artificial Intell."},{"issue":"9","key":"9504_CR7","first-page":"4800","volume":"219","author":"U Benlic","year":"2013","unstructured":"Benlic, U., Hao, J.-K.: Breakout local search for the quadratic assignment problem. Appl. Math. Comput. 219(9), 4800\u20134815 (2013)","journal-title":"Appl. Math. Comput."},{"key":"9504_CR8","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.cor.2016.08.010","volume":"78","author":"U Benlic","year":"2017","unstructured":"Benlic, U., Burke, E.K., Woodward, J.R.: Breakout local search for the multi-objective gate allocation problem. Comput. Oper. Res. 78, 80\u201393 (2017)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"9504_CR9","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1016\/j.ejor.2017.01.023","volume":"261","author":"U Benlic","year":"2017","unstructured":"Benlic, U., Epitropakis, M.G., Burke, E.K.: A hybrid breakout local search and reinforcement learning approach to the vertex separator problem. Eur. J. Oper. Res. 261(3), 803\u2013818 (2017)","journal-title":"Eur. J. Oper. Res."},{"key":"9504_CR10","doi-asserted-by":"publisher","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, 105116 (2021)","journal-title":"Comput. Oper. Res."},{"issue":"1\u20133","key":"9504_CR11","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0166-218X(98)00098-5","volume":"87","author":"JD Chavez","year":"1998","unstructured":"Chavez, J.D., Trapp, R.: The cyclic cutwidth of trees. Discrete Appl. Math. 87(1\u20133), 25\u201332 (1998)","journal-title":"Discrete Appl. Math."},{"key":"9504_CR12","unstructured":"Clarke, D.W.: The cyclic cutwidth of mesh cubes. Theses digitization project. 2329 (2002). https:\/\/scholarworks.lib.csusb.edu\/etdproject\/2329"},{"issue":"1\u20132","key":"9504_CR13","first-page":"37","volume":"2","author":"JP Cohoon","year":"1987","unstructured":"Cohoon, J.P., Sahni, S.: Heuristics for backplane ordering. J. VLSI Comput. Syst. 2(1\u20132), 37\u201360 (1987)","journal-title":"J. VLSI Comput. Syst."},{"issue":"3","key":"9504_CR14","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)"},{"issue":"3","key":"9504_CR15","doi-asserted-by":"publisher","first-page":"656","DOI":"10.4149\/cai_2018_3_656","volume":"37","author":"M El Krari","year":"2018","unstructured":"El Krari, M., Ahiod, B., El Benani, B.: Breakout local search for the travelling salesman problem. Comput. Inform. 37(3), 656\u2013672 (2018)","journal-title":"Comput. Inform."},{"key":"9504_CR16","volume-title":"The cyclic cutwidth of qn","author":"J Erbele","year":"2003","unstructured":"Erbele, J., Chavez, J., Trapp, R.: The cyclic cutwidth of qn. California State University, San Bernardino (2003)"},{"issue":"1","key":"9504_CR17","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.ejor.2013.06.048","volume":"232","author":"Z-H Fu","year":"2014","unstructured":"Fu, Z.-H., Hao, J.-K.: Breakout local search for the steiner tree problem with revenue, budget and hop constraints. Eur. J. Oper. Res. 232(1), 209\u2013220 (2014)","journal-title":"Eur. J. Oper. Res."},{"key":"9504_CR18","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/j.engappai.2014.12.009","volume":"39","author":"S Ghandi","year":"2015","unstructured":"Ghandi, S., Masehian, E.: A breakout local search (bls) method for solving the assembly sequence planning problem. Eng. Appl. Artif. Intell. 39, 245\u2013266 (2015)","journal-title":"Eng. Appl. Artif. Intell."},{"key":"9504_CR19","doi-asserted-by":"crossref","unstructured":"Glover, F., Laguna, M.: Tabu search. In: Handbook of Combinatorial Optimization, pp. 2093\u20132229. Springer (1998)","DOI":"10.1007\/978-1-4613-0303-9_33"},{"issue":"6","key":"9504_CR20","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. Heuristics 22(6), 815\u2013848 (2016)","journal-title":"J. Heuristics"},{"key":"9504_CR21","volume-title":"The Linear and Cyclic Cutwidth of the Complete Bipartite Graph","author":"M Johnson","year":"2003","unstructured":"Johnson, M.: The Linear and Cyclic Cutwidth of the Complete Bipartite Graph. Cal State Univ, San Bernardino, REU Project (2003)"},{"key":"9504_CR22","doi-asserted-by":"crossref","unstructured":"Louren\u00e7o, H.R., Martin, O.C., St\u00fctzle, T.: Iterated local search. In: Handbook of Metaheuristics, pp. 320\u2013353 . Springer (2003)","DOI":"10.1007\/0-306-48056-5_11"},{"issue":"1","key":"9504_CR23","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/s10479-011-0907-2","volume":"199","author":"JJ Pantrigo","year":"2012","unstructured":"Pantrigo, J.J., Mart\u00ed, R., Duarte, A., Pardo, E.G.: Scatter search for the cutwidth minimization problem. Ann. Oper. Res. 199(1), 285\u2013304 (2012)","journal-title":"Ann. Oper. Res."},{"issue":"5","key":"9504_CR24","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."},{"key":"9504_CR25","unstructured":"Raspaud, A., S\u1ef3kora, O., Vrto, I.: Congestion and dilation, similarities and differences: a survey. In: SIROCCO, pp. 269\u2013280 (2000)"},{"issue":"3","key":"9504_CR26","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1016\/j.cor.2008.05.011","volume":"37","author":"MG Resende","year":"2010","unstructured":"Resende, M.G., Mart\u00ed, R., Gallego, M., Duarte, A.: Grasp and path relinking for the max-min diversity problem. Comput. Oper. Res. 37(3), 498\u2013508 (2010)","journal-title":"Comput. Oper. Res."},{"issue":"1\u20133","key":"9504_CR27","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/j.dam.2003.10.006","volume":"143","author":"H Schr\u00f6der","year":"2004","unstructured":"Schr\u00f6der, H., S\u1ef3kora, O., Vrt\u2019o, I.: Cyclic cutwidths of the two-dimensional ordinary and cylindrical meshes. Discrete Appl. Math. 143(1\u20133), 123\u2013129 (2004)","journal-title":"Discrete Appl. Math."},{"key":"9504_CR28","volume-title":"The Cyclic Cutwidth of a p2$$\\times $$ p2$$\\times $$ pn Mesh","author":"V Sciortino","year":"2002","unstructured":"Sciortino, V., Chavez, J., Trapp, R.: The Cyclic Cutwidth of a p2$$\\times $$ p2$$\\times $$ pn Mesh. Cal State Univ, San Bernardino, REU Project (2002)"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-022-09504-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10732-022-09504-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-022-09504-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,3]],"date-time":"2022-11-03T09:20:23Z","timestamp":1667467223000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10732-022-09504-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,31]]},"references-count":28,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["9504"],"URL":"https:\/\/doi.org\/10.1007\/s10732-022-09504-5","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8,31]]},"assertion":[{"value":"7 December 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 May 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 July 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 August 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}