{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T01:20:12Z","timestamp":1773883212556,"version":"3.50.1"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030857127","type":"print"},{"value":"9783030857134","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-85713-4_14","type":"book-chapter","created":{"date-parts":[[2021,9,12]],"date-time":"2021-09-12T23:04:33Z","timestamp":1631487873000},"page":"139-149","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Influence of the Alternative Objective Functions in the Optimization of the Cyclic Cutwidth Minimization Problem"],"prefix":"10.1007","author":[{"given":"Sergio","family":"Cavero","sequence":"first","affiliation":[]},{"given":"Eduardo G.","family":"Pardo","sequence":"additional","affiliation":[]},{"given":"Abraham","family":"Duarte","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,13]]},"reference":[{"issue":"5","key":"14_CR1","doi-asserted-by":"publisher","first-page":"557","DOI":"10.4153\/CMB-1966-068-6","volume":"9","author":"H Abbott","year":"1966","unstructured":"Abbott, H.: Hamiltonian circuits and paths on the n-cube. Can. Math. Bull. 9(5), 557\u2013562 (1966)","journal-title":"Can. Math. Bull."},{"key":"14_CR2","unstructured":"Aschenbrenner, R.: A proof for the cyclic cutwidth of q5. Cal State University, San Bernardino, REU Project (2001)"},{"key":"14_CR3","unstructured":"Castillo, C.: A proof for the cyclic cutwidth of q6. Cal State University, San Bernardino, REU Project (2003)"},{"key":"14_CR4","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."},{"issue":"1\u20132","key":"14_CR5","first-page":"37","volume":"2","author":"J Cohoon","year":"1987","unstructured":"Cohoon, J., Sahni, S.: Heuristics for the backplane ordering. J. VLSI Comput. Syst. 2(1\u20132), 37\u201360 (1987)","journal-title":"J. VLSI Comput. Syst."},{"issue":"3","key":"14_CR6","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":"1","key":"14_CR7","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":"14_CR8","unstructured":"Duff, I.S., Grimes, R.G., Lewis, J.G.: Users\u2019 guide for the harwell-boeing sparse matrix collection (release i) (1992)"},{"key":"14_CR9","unstructured":"Erbele, J., Chavez, J., Trapp, R.: The cyclic cutwidth of qn. California State University, San Bernardino USA, Manuscript (2003)"},{"key":"14_CR10","unstructured":"Gavril, F.: Some np-complete problems on graphs. Technical Report, Computer Science Department, Technion (2011)"},{"issue":"3","key":"14_CR11","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":"6","key":"14_CR12","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":"14_CR13","unstructured":"James, B.: The cyclical cutwidth of the three-dimensional and four dimensional cubes. Cal State University, San Bernardino McNair Scholar\u2019s Program Summer Research Journal (1996)"},{"key":"14_CR14","unstructured":"Johnson, M.: The linear and cyclic cutwidth of the complete bipartite graph. Cal State University, San Bernardino, REU Project (2003)"},{"issue":"3","key":"14_CR15","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0166-218X(89)90016-4","volume":"23","author":"F Makedon","year":"1989","unstructured":"Makedon, F., Sudborough, I.: On minimizing width in linear layouts. Discrete Appl. Math. 23(3), 243\u2013265 (1989)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"14_CR16","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.cor.2012.05.016","volume":"40","author":"R Mart\u00ed","year":"2013","unstructured":"Mart\u00ed, R., Pantrigo, J.J., Duarte, A., Pardo, E.G.: Branch and bound for the cutwidth minimization problem. Comput. Oper. Res. 40(1), 137\u2013149 (2013)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"14_CR17","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."},{"key":"14_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-07153-4_45-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). https:\/\/doi.org\/10.1007\/978-3-319-07153-4_45-1"},{"issue":"5","key":"14_CR19","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":"14_CR20","unstructured":"Rios, F.R.: Complete graphs as a first step toward finding the cyclic cutwidth of the n-cube. Cal State University. San Bernardino McNair Scholar\u2019s Program Summer Research Journal (1996)"},{"issue":"3","key":"14_CR21","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":"14_CR22","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":"14_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/3-540-60618-1_80","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"J Rolim","year":"1995","unstructured":"Rolim, J., S\u00fdkora, O., Vrt\u2019o, I.: Optimal cutwidths and bisection widths of 2- and 3-dimensional meshes. In: Nagl, M. (ed.) WG 1995. LNCS, vol. 1017, pp. 252\u2013264. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-60618-1_80"},{"issue":"3","key":"14_CR24","doi-asserted-by":"publisher","first-page":"1056","DOI":"10.1016\/j.ejor.2019.07.013","volume":"289","author":"VGM Santos","year":"2021","unstructured":"Santos, V.G.M., de Carvalho, M.A.M.: Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem. Eur. J. Oper. Res. 289(3), 1056\u20131066 (2021)","journal-title":"Eur. J. Oper. Res."},{"key":"14_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/3-540-47849-3_33","volume-title":"SOFSEM 1999: Theory and Practice of Informatics","author":"H Schr\u00f6der","year":"1999","unstructured":"Schr\u00f6der, H., S\u00fdykoa, O., Vrt\u2019o, I.: Cyclic cutwidth of the mesh. In: Pavelka, J., Tel, G., Barto\u0161ek, M. (eds.) SOFSEM 1999. LNCS, vol. 1725, pp. 449\u2013458. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-47849-3_33"},{"key":"14_CR26","doi-asserted-by":"crossref","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-3), 123\u2013129 (2004)","DOI":"10.1016\/j.dam.2003.10.006"},{"key":"14_CR27","unstructured":"Sciortino, V., Chavez, J., Trapp, R.: The cyclic cutwidth of a $$p_2\\times p_2\\times p_n$$ mesh. Cal State University, San Bernardino, REU Project (2002)"},{"issue":"1","key":"14_CR28","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.jalgor.2004.12.003","volume":"56","author":"DM Thilikos","year":"2005","unstructured":"Thilikos, D.M., Serna, M., Bodlaender, H.L.: Cutwidth II: algorithms for partial w-trees of bounded degree. J. Algorithms 56(1), 25\u201349 (2005)","journal-title":"J. Algorithms"}],"container-title":["Lecture Notes in Computer Science","Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-85713-4_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,12]],"date-time":"2021-09-12T23:10:16Z","timestamp":1631488216000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-85713-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030857127","9783030857134"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-85713-4_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"13 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CAEPIA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference of the Spanish Association for Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"M\u00e1laga","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caepia2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/caepia2020.uma.es\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"40","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"63% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The 2020 conference was cancelled due to COVID-19 and held together with CAEPIA 2021","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}