{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T20:06:43Z","timestamp":1757621203862,"version":"3.44.0"},"publisher-location":"Singapore","reference-count":24,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819502172"},{"type":"electronic","value":"9789819502189"}],"license":[{"start":{"date-parts":[[2025,8,3]],"date-time":"2025-08-03T00:00:00Z","timestamp":1754179200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,3]],"date-time":"2025-08-03T00:00:00Z","timestamp":1754179200000},"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":[[2026]]},"DOI":"10.1007\/978-981-95-0218-9_10","type":"book-chapter","created":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T21:09:19Z","timestamp":1754168959000},"page":"125-138","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Multi-start Variable Neighborhood Tabu Search Algorithm for\u00a0the\u00a0Cyclic Bandwidth Problem"],"prefix":"10.1007","author":[{"given":"Yuan","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianhang","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhipeng","family":"L\u00fc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhouxing","family":"Su","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junwen","family":"Ding","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qingyun","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,8,3]]},"reference":[{"issue":"3","key":"10_CR1","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."},{"issue":"3","key":"10_CR2","first-page":"282","volume":"7","author":"YX Lin","year":"1994","unstructured":"Lin, Y.X.: The cyclic bandwidth problem. Syst. Sci. Math. Sci. 7(3), 282\u2013288 (1994)","journal-title":"Syst. Sci. Math. Sci."},{"key":"10_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105422","volume":"135","author":"F Rendl","year":"2021","unstructured":"Rendl, F., Sotirov, R., Truden, C.: Lower bounds for the bandwidth problem. Comput. Oper. Res. 135, 105422 (2021)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"10_CR4","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1002\/(SICI)1097-0118(199906)31:2<75::AID-JGT1>3.0.CO;2-S","volume":"31","author":"Y-L Lai","year":"1999","unstructured":"Lai, Y.-L., Williams, K.: A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs. J. Graph Theor. 31(2), 75\u201394 (1999)","journal-title":"J. Graph Theor."},{"issue":"3","key":"10_CR5","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.J.: A survey of graph layout problems. ACM Comput. Surv. 34(3), 313\u2013356 (2002)","journal-title":"ACM Comput. Surv."},{"issue":"1","key":"10_CR6","first-page":"55","volume":"21","author":"R Huang","year":"2023","unstructured":"Huang, R., Li, H., Zhang, Y.: Efficient bandwidth allocation and computation configuration in industrial IoT. ZTE Commun. 21(1), 55\u201363 (2023)","journal-title":"ZTE Commun."},{"issue":"3","key":"10_CR7","first-page":"55","volume":"10","author":"H Yang","year":"2012","unstructured":"Yang, H., Zhao, Y., Huang, S., Wang, D., Cao, X., Lin, X.: Multiple-constraint-aware RWA algorithms based on a comprehensive evaluation model: use in wavelength-switched optical networks. ZTE Commun. 10(3), 55\u201361 (2012)","journal-title":"ZTE Commun."},{"key":"10_CR8","doi-asserted-by":"publisher","unstructured":"Hromkovi\u010d, J., M\u00fcller, V., S\u00fdkora, O., Vrto, I.: On embedding interconnection networks into rings of processors. In: Etiemble, D., Syre, J.-C. (eds.) PARLE Conference 1992, LNCS, vol. 605, pp. 53\u201362. Springer (1992). https:\/\/doi.org\/10.1007\/3-540-55599-4_80","DOI":"10.1007\/3-540-55599-4_80"},{"issue":"1","key":"10_CR9","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/S0012-365X(00)00379-4","volume":"242","author":"P Lam","year":"2002","unstructured":"Lam, P., Shiu, W.C., Chan, W.H.: Characterization of graphs with equal bandwidth and cyclic bandwidth. Discret. Math. 242(1), 283\u2013289 (2002)","journal-title":"Discret. Math."},{"issue":"3","key":"10_CR10","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1002\/(SICI)1097-0037(199705)29:3<135::AID-NET1>3.0.CO;2-I","volume":"29","author":"Y Lin","year":"1997","unstructured":"Lin, Y.: Minimum bandwidth problem for embedding graphs in cycles. Networks 29(3), 135\u2013140 (1997)","journal-title":"Networks"},{"key":"10_CR11","unstructured":"Lam, P.C.B., Shiu, W.C., Chan, W.H.: On bandwidth and cyclic bandwidth of graphs. Ars Combinatoria 47, (1997)"},{"issue":"2","key":"10_CR12","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1016\/S0304-3975(00)00068-2","volume":"249","author":"S Zhou","year":"2000","unstructured":"Zhou, S.: Bounding the bandwidths for graphs. Theoret. Comput. Sci. 249(2), 357\u2013368 (2000)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"10_CR13","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/j.dam.2007.09.011","volume":"156","author":"WH Chan","year":"2008","unstructured":"Chan, W.H., Lam, P., Shiu, W.C.: Cyclic bandwidth with an edge added. Discret. Appl. Math. 156(1), 131\u2013137 (2008)","journal-title":"Discret. Appl. Math."},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"de Klerk, E., E.-Nagy, M., Sotirov, R.: On semidefinite programming bounds for graph bandwidth. Optim. Methods Softw. 28(3), 485\u2013500 (2013)","DOI":"10.1080\/10556788.2012.709856"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"D\u00e9pr\u00e9s, H., Fertin, G., Monfroy, \u00c9.: Improved lower bounds for the cyclic bandwidth problem. In: Paszynski, M., Kranzlm\u00fcller, D., Krzhizhanovskaya, V.V., Dongarra, J.J., Sloot, P.M.A. (eds.) ICCS 2021, LNCS, vol. 12742, pp. 555\u2013569. Springer (2021). 10.1007\/978-3-030-77961-0_45","DOI":"10.1007\/978-3-030-77961-0_45"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Fertin, G., Monfroy, \u00c9., Vasconcellos-Gaete, C.: Best of Both worlds: solving the cyclic bandwidth problem by combining pre-existing knowledge and constraint programming techniques. In: Franco, L., de Mulatier, C., Paszynski, M., Krzhizhanovskaya, V.V., Dongarra, J.J., Sloot, P.M.A. (eds.) ICCS 2024, LNCS, vol. 14836, pp. 197\u2013211. Springer (2024). 10.1007\/978-3-031-63775-9_14","DOI":"10.1007\/978-3-031-63775-9_14"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Romero-Monsivais, H., Rodriguez-Tello, E., Ram\u00edrez-Torres, G.: A new branch and bound algorithm for the cyclic bandwidth problem. In: Batyrshin, I.Z., Gonz\u00e1lez-Mendoza, M. (eds.) MICAI 2012, LNCS, vol. 7630, pp. 139\u2013150. Springer (2012). 10.1007\/978-3-642-37798-3_13","DOI":"10.1007\/978-3-642-37798-3_13"},{"key":"10_CR18","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":"10_CR19","doi-asserted-by":"publisher","first-page":"98436","DOI":"10.1109\/ACCESS.2019.2929410","volume":"7","author":"J Ren","year":"2019","unstructured":"Ren, J., Hao, J.-K., Rodriguez-Tello, E.: An iterated three-phase search approach for solving the cyclic bandwidth problem. IEEE Access 7, 98436\u201398452 (2019)","journal-title":"IEEE Access"},{"key":"10_CR20","doi-asserted-by":"publisher","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, 106136 (2020)","journal-title":"Knowl. Based Syst."},{"issue":"3","key":"10_CR21","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1002\/jgt.3190060302","volume":"6","author":"PZ Chinn","year":"1982","unstructured":"Chinn, P.Z., Chvatalova, J., Dewdney, A.K., Gibbs, N.E.: The bandwidth problem for graphs and matrices - a survey. J. Graph Theor. 6(3), 223\u2013254 (1982)","journal-title":"J. Graph Theor."},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"Glover, F., Laguna, M.: Tabu search. Springer (1998)","DOI":"10.1007\/978-1-4615-6089-0"},{"issue":"11","key":"10_CR23","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":"10_CR24","first-page":"43","volume":"3","author":"M L\u00f3pez-Ib\u00e1\u00f1ez","year":"2016","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M., Dubois-Lacoste, J., P\u00e9rez C\u00e1ceres, L., Birattari, M., St\u00fctzle, T.: The irace package: Iterated racing for automatic algorithm configuration. Oper. Res. Perspect. 3, 43\u201358 (2016)","journal-title":"Oper. Res. Perspect."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-0218-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T12:41:09Z","timestamp":1757335269000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-0218-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,3]]},"ISBN":["9789819502172","9789819502189"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-0218-9_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,8,3]]},"assertion":[{"value":"3 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chengdu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon0","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcsuestc.com\/cocoon2025\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}