{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,3]],"date-time":"2025-08-03T22:59:30Z","timestamp":1754261970624,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031637742"},{"type":"electronic","value":"9783031637759"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-63775-9_14","type":"book-chapter","created":{"date-parts":[[2024,6,27]],"date-time":"2024-06-27T06:03:07Z","timestamp":1719468187000},"page":"197-211","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Best of\u00a0Both\u00a0Worlds: Solving the\u00a0Cyclic Bandwidth Problem by\u00a0Combining Pre-existing Knowledge and\u00a0Constraint Programming Techniques"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8251-2012","authenticated-orcid":false,"given":"Guillaume","family":"Fertin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7970-1368","authenticated-orcid":false,"given":"Eric","family":"Monfroy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9487-0573","authenticated-orcid":false,"given":"Claudia","family":"Vasconcellos-Gaete","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,6,28]]},"reference":[{"issue":"6","key":"14_CR1","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1017\/S1471068401000072","volume":"1","author":"KR Apt","year":"2001","unstructured":"Apt, K.R., Monfroy, \u00c9.: Constraint programming viewed as rule-based programming. Theory Pract. Log. Program. 1(6), 713\u2013750 (2001)","journal-title":"Theory Pract. Log. Program."},{"issue":"3","key":"14_CR2","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1002\/jgt.3190060302","volume":"6","author":"PZ Chinn","year":"1982","unstructured":"Chinn, P.Z., Chv\u00e1talov\u00e1, 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":"14_CR3","first-page":"151","volume":"3","author":"FR Chung","year":"1988","unstructured":"Chung, F.R.: Labelings of graphs. Sel. Top. Graph Theor. 3, 151\u2013168 (1988)","journal-title":"Sel. Top. Graph Theor."},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/978-3-030-77961-0_45","volume-title":"Computational Science \u2013 ICCS 2021","author":"H D\u00e9pr\u00e9s","year":"2021","unstructured":"D\u00e9pr\u00e9s, H., Fertin, G., Monfroy, E.: 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, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77961-0_45"},{"issue":"1","key":"14_CR5","first-page":"55","volume":"21","author":"F Harary","year":"1971","unstructured":"Harary, F., Manvel, B.: On the number of cycles in a graph. Matematick\u1ef3 \u010dasopis 21(1), 55\u201363 (1971)","journal-title":"Matematick\u1ef3 \u010dasopis"},{"issue":"1","key":"14_CR6","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1137\/0112012","volume":"12","author":"LH Harper","year":"1964","unstructured":"Harper, L.H.: Optimal assignments of numbers to vertices. J. Soc. Ind. Appl. Math. 12(1), 131\u2013135 (1964)","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"14_CR7","unstructured":"van Hoeve, W.J.: The all different constraint: a survey. CoRR cs.PL\/0105015 (2001). https:\/\/arxiv.org\/abs\/cs\/0105015"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/3-540-55599-4_80","volume-title":"PARLE \u201992 Parallel Architectures and Languages Europe","author":"J Hromkovi\u010d","year":"1992","unstructured":"Hromkovi\u010d, J., M\u00fcller, V., S\u00fdkora, O., Vr\u0165o, I.: On embedding interconnection networks into rings of processors. In: Etiemble, D., Syre, J.-C. (eds.) PARLE 1992. LNCS, vol. 605, pp. 51\u201362. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-55599-4_80"},{"issue":"1\u20133","key":"14_CR9","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/S0012-365X(00)00379-4","volume":"242","author":"PCB Lam","year":"2002","unstructured":"Lam, P.C.B., Shiu, W.C., Chan, W.H.: Characterization of graphs with equal bandwidth and cyclic bandwidth. Discret. Math. 242(1\u20133), 283\u2013289 (2002)","journal-title":"Discret. Math."},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/978-3-540-85958-1_9","volume-title":"Principles and Practice of Constraint Programming","author":"C Lecoutre","year":"2008","unstructured":"Lecoutre, C.: Optimization of simple tabular reduction for table constraints. In: Stuckey, P.J. (ed.) CP 2008. LNCS, vol. 5202, pp. 128\u2013143. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85958-1_9"},{"issue":"3","key":"14_CR11","doi-asserted-by":"publisher","first-page":"650","DOI":"10.1137\/0213040","volume":"13","author":"JY Leung","year":"1984","unstructured":"Leung, J.Y., 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":"1","key":"14_CR12","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1111\/j.1749-6632.1989.tb16417.x","volume":"576","author":"Y Lin","year":"1989","unstructured":"Lin, Y.: A level structure approach on the bandwidth problem for special graphs. Ann. N. Y. Acad. Sci. 576(1), 344\u2013357 (1989)","journal-title":"Ann. N. Y. Acad. Sci."},{"key":"14_CR13","unstructured":"Lin, Y.: The cyclic bandwidth problem. Syst. Sci. Math. Sci. 7 (1994)"},{"issue":"3","key":"14_CR14","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":"14_CR15","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1016\/j.ejor.2007.02.004","volume":"186","author":"R Mart\u00ed","year":"2008","unstructured":"Mart\u00ed, R., Campos, V., Pi\u00f1ana, E.: A branch and bound algorithm for the matrix bandwidth minimization. Eur. J. Oper. Res. 186, 513\u2013528 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"14_CR16","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, 450\u2013459 (2001)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"14_CR17","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.ejor.2008.12.015","volume":"200","author":"N Mladenovic","year":"2010","unstructured":"Mladenovic, N., Urosevic, D., P\u00e9rez-Brito, D., Garc\u00eda-Gonz\u00e1lez, C.: Variable neighbourhood search for bandwidth reduction. Eur. J. Oper. Res. 200(1), 14\u201327 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"12","key":"14_CR18","doi-asserted-by":"publisher","first-page":"1851","DOI":"10.1080\/02331934.2013.830120","volume":"63","author":"P Pop","year":"2014","unstructured":"Pop, P., Matei, O., Comes, C.A.: Reducing the bandwidth of a sparse matrix with a genetic algorithm. Optimization 63(12), 1851\u20131876 (2014)","journal-title":"Optimization"},{"key":"14_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., 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":"14_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":"14_CR21","doi-asserted-by":"publisher","first-page":"1319","DOI":"10.1016\/j.ejor.2005.12.052","volume":"185","author":"E Rodriguez-Tello","year":"2008","unstructured":"Rodriguez-Tello, E., Hao, J.K., Torres-Jimenez, J.: An improved simulated annealing algorithm for bandwidth minimization. Eur. J. Oper. Res. 185(3), 1319\u20131335 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"14_CR22","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., Ram\u00edrez-Torres, G., Lardeux, F.: Tabu search for the cyclic bandwidth problem. Comput. Oper. Res. 57, 17\u201332 (2015)","journal-title":"Comput. Oper. Res."},{"key":"14_CR23","unstructured":"Rossi, F., van Beek, P., Walsh, T. (eds.): Handbook of Constraint Programming, Foundations of Artificial Intelligence, vol.\u00a02. Elsevier (2006)"},{"key":"14_CR24","unstructured":"XCSP3 Team: PyCSP$$^{3}$$ v2.2 (2023). https:\/\/www.pycsp.org\/"},{"issue":"2","key":"14_CR25","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."}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-63775-9_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,24]],"date-time":"2024-09-24T13:48:47Z","timestamp":1727185727000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-63775-9_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031637742","9783031637759"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-63775-9_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"28 June 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Malaga","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-computsci2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccs-meeting.org\/iccs2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}