{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T20:11:47Z","timestamp":1773864707165,"version":"3.50.1"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032195814","type":"print"},{"value":"9783032195821","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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-3-032-19582-1_10","type":"book-chapter","created":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T12:37:07Z","timestamp":1773837427000},"page":"134-149","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Variable Formulation Search for\u00a0the\u00a0Cyclic Min-Max Sitting Arrangement Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8376-6209","authenticated-orcid":false,"given":"Marcos","family":"Robles","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5258-5915","authenticated-orcid":false,"given":"Sergio","family":"Cavero","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6247-5269","authenticated-orcid":false,"given":"Eduardo G.","family":"Pardo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,3,19]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","unstructured":"Ben\u00edtez, F., Aracena, J., Caro, C.T.: The sitting closer to friends than enemies problem in the circumference (2018). https:\/\/doi.org\/10.48550\/arXiv.1811.02699","DOI":"10.48550\/arXiv.1811.02699"},{"key":"10_CR2","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/978-3-031-62912-9_38","volume-title":"MIC 2024","author":"S Cavero","year":"2024","unstructured":"Cavero, S., Colmenar, J.M., Pardo, E.G.: A variable formulation search approach for three graph layout problems. In: Sevaux, M., Olteanu, A.L., Pardo, E.G., Sifaleras, A., Makboul, S. (eds.) MIC 2024. LNCS, vol. 14753, pp. 390\u2013396. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-62912-9_38"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-030-85713-4_14","volume-title":"Advances in Artificial Intelligence","author":"S Cavero","year":"2021","unstructured":"Cavero, S., Pardo, E.G., Duarte, A.: Influence of the alternative objective functions in the optimization of the cyclic cutwidth minimization problem. In: Alba, E., et al. (eds.) CAEPIA 2021. LNCS (LNAI), vol. 12882, pp. 139\u2013149. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-85713-4_14"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-07153-4_45-2","volume-title":"Graph Layout Problems","author":"S Cavero","year":"2025","unstructured":"Cavero, S., Pardo, E.G., Duarte, A., Mart\u00ed, R.: Graph Layout Problems, pp. 1\u201331. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-319-07153-4_45-2"},{"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.: A survey of graph layout problems. ACM Comput. Surv. 34(3), 313\u2013356 (2002). https:\/\/doi.org\/10.1145\/568522.568523","journal-title":"ACM Comput. Surv."},{"key":"10_CR6","series-title":"International Series in Operations Research & Management Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-319-91086-4_3","volume-title":"Handbook of Metaheuristics","author":"P Hansen","year":"2019","unstructured":"Hansen, P., Mladenovi\u0107, N., Brimberg, J., P\u00e9rez, J.A.M.: Variable neighborhood search. In: Gendreau, M., Potvin, J.-Y. (eds.) Handbook of Metaheuristics. ISORMS, vol. 272, pp. 57\u201397. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-319-91086-4_3"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/978-3-642-22993-0_36","volume-title":"Mathematical Foundations of Computer Science 2011","author":"A-M Kermarrec","year":"2011","unstructured":"Kermarrec, A.-M., Thraves, C.: Can everybody sit closer to their friends than their enemies? In: Murlak, F., Sankowski, P. (eds.) MFCS 2011. LNCS, vol. 6907, pp. 388\u2013399. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22993-0_36"},{"key":"10_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2022.109452","volume":"128","author":"K Meidani","year":"2022","unstructured":"Meidani, K., Mirjalili, S., Barati Farimani, A.: MAB-OS: multi-armed bandits metaheuristic optimizer selection. Appl. Soft Comput. 128, 109452 (2022). https:\/\/doi.org\/10.1016\/j.asoc.2022.109452","journal-title":"Appl. Soft Comput."},{"issue":"1","key":"10_CR9","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s10288-012-0212-1","volume":"11","author":"N Mladenovi\u0107","year":"2013","unstructured":"Mladenovi\u0107, N., Uro\u0161evi\u0107, D., Hanafi, S.: Variable neighborhood search for the travelling deliveryman problem. 4OR 11(1), 57\u201373 (2013). https:\/\/doi.org\/10.1007\/s10288-012-0212-1","journal-title":"4OR"},{"issue":"10","key":"10_CR10","doi-asserted-by":"publisher","first-page":"1189","DOI":"10.1109\/PROC.1981.12160","volume":"69","author":"AR Newton","year":"1981","unstructured":"Newton, A.R.: Computer-aided design of VLSI circuits. Proc. IEEE 69(10), 1189\u20131199 (1981)","journal-title":"Proc. IEEE"},{"issue":"5","key":"10_CR11","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). https:\/\/doi.org\/10.1016\/j.asoc.2013.01.016","journal-title":"Appl. Soft Comput."},{"key":"10_CR12","doi-asserted-by":"publisher","unstructured":"Pardo, E.G., Soto, M., Thraves, C.: Embedding signed graphs in the line: Heuristics to solve MinSA problem. J. Comb. Optim. 29(2), 451\u2013471 (2015). https:\/\/doi.org\/10.1007\/s10878-013-9604-1","DOI":"10.1007\/s10878-013-9604-1"},{"key":"10_CR13","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/978-3-031-34500-5_7","volume-title":"ICVNS 2022","author":"M Robles","year":"2023","unstructured":"Robles, M., Cavero, S., Pardo, E.G.: BVNS for the minimum sitting arrangement problem in a cycle. In: Sleptchenko, A., Sifaleras, A., Hansen, P. (eds.) ICVNS 2022. LNCS, vol. 13863, pp. 82\u201396. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-34500-5_7"},{"key":"10_CR14","unstructured":"Robles, M., Cavero, S., Pardo, E.G.: Heur\u00edsticas multiarranque para el problema de cmmsa. In: XVI Congreso Espa\u00f1ol de Metaheur\u00edsticas, Algoritmos Evolutivos y Bioinspirados (2025)"},{"key":"10_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2025.107034","volume":"179","author":"M Robles","year":"2025","unstructured":"Robles, M., Cavero, S., Pardo, E.G., Cord\u00f3n, O.: Multi-armed bandit for the cyclic minimum sitting arrangement problem. Comput. Oper. Res. 179, 107034 (2025). https:\/\/doi.org\/10.1016\/j.cor.2025.107034","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"10_CR16","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). https:\/\/doi.org\/10.1016\/j.ejor.2018.09.031","journal-title":"Eur. J. Oper. Res."},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Zaslavsky, T.: A mathematical bibliography of signed and gain graphs and allied areas. Electron. J. Comb. DS8 (2018). https:\/\/doi.org\/10.37236\/29","DOI":"10.37236\/29"}],"container-title":["Lecture Notes in Computer Science","Variable Neighborhood Search"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-19582-1_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T12:37:16Z","timestamp":1773837436000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-19582-1_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032195814","9783032195821"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-19582-1_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"19 March 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICVNS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Variable Neighborhood Search","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Montreal, QC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","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":"12 May 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 May 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icvns2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2025.icvns.com","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}