{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T01:18:43Z","timestamp":1773883123927,"version":"3.50.1"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031344992","type":"print"},{"value":"9783031345005","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-34500-5_7","type":"book-chapter","created":{"date-parts":[[2023,5,28]],"date-time":"2023-05-28T06:01:58Z","timestamp":1685253718000},"page":"82-96","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["BVNS for\u00a0the\u00a0Minimum Sitting Arrangement Problem in\u00a0a\u00a0Cycle"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8376-6209","authenticated-orcid":false,"given":"Marcos","family":"Robles","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5258-5915","authenticated-orcid":false,"given":"Sergio","family":"Cavero","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6247-5269","authenticated-orcid":false,"given":"Eduardo G.","family":"Pardo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,29]]},"reference":[{"key":"7_CR1","unstructured":"Aracena, J., Caro, C.T.: The weighted sitting closer to friends than enemies problem in the line. arXiv preprint arXiv:1906.11812 (2019)"},{"key":"7_CR2","unstructured":"Becerra, R., Caro, C.T.: On the sitting closer to friends than enemies problem in trees and an intersection model for strongly chordal graphs. arXiv preprint arXiv:1911.11494 (2019)"},{"key":"7_CR3","unstructured":"Ben\u00edtez, F., Aracena, J., Caro, C.T.: The sitting closer to friends than enemies problem in the circumference. arXiv preprint arXiv:1811.02699 (2018)"},{"issue":"2","key":"7_CR4","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/0022-0000(84)90071-0","volume":"28","author":"SN Bhatt","year":"1984","unstructured":"Bhatt, S.N., Leighton, F.T.: A framework for solving VLSI graph layout problems. J. Comput. Syst. Sci. 28(2), 300\u2013343 (1984)","journal-title":"J. Comput. Syst. Sci."},{"issue":"5","key":"7_CR5","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.70.056135","volume":"70","author":"RF Cancho","year":"2004","unstructured":"Cancho, R.F.: Euclidean distance between syntactically linked words. Phys. Rev. E 70(5), 056135 (2004)","journal-title":"Phys. Rev. E"},{"key":"7_CR6","doi-asserted-by":"publisher","unstructured":"Cavero, S., Pardo, E.G., Duarte, A.: Efficient iterated greedy for the two-dimensional bandwidth minimization problem. Eur. J. Oper. Res. (2022). https:\/\/doi.org\/10.1016\/j.ejor.2022.09.004, in press","DOI":"10.1016\/j.ejor.2022.09.004"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Cavero, S., Pardo, E.G., Duarte, A.: A general variable neighborhood search for the cyclic antibandwidth problem. In: Computational Optimization and Applications, pp. 1\u201331 (2022)","DOI":"10.1007\/s10589-021-00334-y"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Cavero, S., Pardo, E.G., Duarte, A., Rodriguez-Tello, E.: A variable neighborhood search approach for cyclic bandwidth sum problem. Knowl. Based Syst. 108680 (2022)","DOI":"10.1016\/j.knosys.2022.108680"},{"key":"7_CR9","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":"15","key":"7_CR10","first-page":"8121","volume":"219","author":"P Civicioglu","year":"2013","unstructured":"Civicioglu, P.: Backtracking search optimization algorithm for numerical optimization problems. Appl. Math. Comput. 219(15), 8121\u20138144 (2013)","journal-title":"Appl. Math. Comput."},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/978-3-642-32589-2_28","volume-title":"Mathematical Foundations of Computer Science 2012","author":"M Cygan","year":"2012","unstructured":"Cygan, M., Pilipczuk, M., Pilipczuk, M., Wojtaszczyk, J.O.: Sitting closer to friends than enemies, revisited. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol. 7464, pp. 296\u2013307. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32589-2_28"},{"issue":"3","key":"7_CR12","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":"4","key":"7_CR13","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1002\/jgt.3190200412","volume":"20","author":"G Ding","year":"1995","unstructured":"Ding, G., Oporowski, B.: Some results on tree decomposition of graphs. J. Graph Theory 20(4), 481\u2013499 (1995)","journal-title":"J. Graph Theory"},{"issue":"1","key":"7_CR14","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."},{"issue":"2\u20133","key":"7_CR15","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0012-365X(83)90154-1","volume":"43","author":"M Farber","year":"1983","unstructured":"Farber, M.: Characterizations of strongly chordal graphs. Discret. Math. 43(2\u20133), 173\u2013189 (1983)","journal-title":"Discret. Math."},{"issue":"3","key":"7_CR16","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P Hansen","year":"2001","unstructured":"Hansen, P., Mladenovi\u0107, N.: Variable neighborhood search: principles and applications. Eur. J. Oper. Res. 130(3), 449\u2013467 (2001)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"7_CR17","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s13675-016-0075-x","volume":"5","author":"P Hansen","year":"2017","unstructured":"Hansen, P., Mladenovi\u0107, N., Todosijevi\u0107, R., Hanafi, S.: Variable neighborhood search: basics and variants. EURO J. Comput. Optim. 5(3), 423\u2013454 (2017)","journal-title":"EURO J. Comput. Optim."},{"key":"7_CR18","doi-asserted-by":"publisher","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","DOI":"10.1007\/978-3-642-22993-0_36"},{"key":"7_CR19","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-540-68279-0_5","volume-title":"50 Years of Integer Programming 1958-2008","author":"AH Land","year":"2010","unstructured":"Land, A.H., Doig, A.G.: An automatic method for solving discrete programming problems. In: J\u00fcnger, M., Liebling, T.M., Naddef, D., Nemhauser, G.L., Pulleyblank, W.R., Reinelt, G., Rinaldi, G., Wolsey, L.A. (eds.) 50 Years of Integer Programming 1958-2008, pp. 105\u2013132. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-540-68279-0_5"},{"issue":"6","key":"7_CR20","doi-asserted-by":"publisher","first-page":"972","DOI":"10.1287\/opre.11.6.972","volume":"11","author":"JD Little","year":"1963","unstructured":"Little, J.D., Murty, K.G., Sweeney, D.W., Karel, C.: An algorithm for the traveling salesman problem. Oper. Res. 11(6), 972\u2013989 (1963)","journal-title":"Oper. Res."},{"issue":"2","key":"7_CR21","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s10732-019-09432-x","volume":"26","author":"EG Pardo","year":"2020","unstructured":"Pardo, E.G., Garc\u00eda-S\u00e1nchez, A., Sevaux, M., Duarte, A.: Basic variable neighborhood search for the minimum sitting arrangement problem. J. Heuristics 26(2), 249\u2013268 (2020)","journal-title":"J. Heuristics"},{"key":"7_CR22","doi-asserted-by":"publisher","first-page":"1025","DOI":"10.1007\/978-3-319-07124-4_45","volume-title":"Handbook of Heuristics","author":"EG Pardo","year":"2018","unstructured":"Pardo, E.G., Mart\u00ed, R., Duarte, A.: Linear layout problems. In: Mart\u00ed, R., Pardalos, P.M., Resende, M.G.C. (eds.) Handbook of Heuristics, pp. 1025\u20131049. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-07124-4_45"},{"issue":"2","key":"7_CR23","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/s10878-013-9604-1","volume":"29","author":"EG Pardo","year":"2015","unstructured":"Pardo, E.G., Soto, M., Thraves, C.: Embedding signed graphs in the line. J. Comb. Optim. 29(2), 451\u2013471 (2015)","journal-title":"J. Comb. Optim."},{"issue":"10","key":"7_CR24","doi-asserted-by":"publisher","first-page":"3331","DOI":"10.1016\/j.cor.2007.03.001","volume":"35","author":"E Rodriguez-Tello","year":"2008","unstructured":"Rodriguez-Tello, E., Hao, J.K., Torres-Jimenez, J.: An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem. Comput. Oper. Res. 35(10), 3331\u20133346 (2008)","journal-title":"Comput. Oper. Res."},{"key":"7_CR25","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.cor.2013.11.008","volume":"52","author":"J S\u00e1nchez-Oro","year":"2014","unstructured":"S\u00e1nchez-Oro, J., Pantrigo, J.J., Duarte, A.: Combining intensification and diversification strategies in VNS an application to the vertex separation problem. Comput. Oper. Res. 52, 209\u2013219 (2014)","journal-title":"Comput. Oper. Res."},{"key":"7_CR26","doi-asserted-by":"crossref","unstructured":"Tamassia, R.: Handbook of Graph Drawing and Visualization. CRC Press (2013)","DOI":"10.1201\/b15385"},{"issue":"1","key":"7_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/0209001","volume":"9","author":"A Tucker","year":"1980","unstructured":"Tucker, A.: An efficient test for circular-arc graphs. SIAM J. Comput. 9(1), 1\u201324 (1980)","journal-title":"SIAM J. Comput."},{"key":"7_CR28","doi-asserted-by":"publisher","unstructured":"Wilcoxon, F.: Individual comparisons by ranking methods. In: In: Kotz, S., Johnson, N.L. (eds.) Breakthroughs in Statistics. Springer Series in Statistics, pp. 196\u2013202. Springer, New York (1992). https:\/\/doi.org\/10.1007\/978-1-4612-4380-9_16","DOI":"10.1007\/978-1-4612-4380-9_16"}],"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-031-34500-5_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,28]],"date-time":"2023-05-28T06:02:35Z","timestamp":1685253755000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-34500-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031344992","9783031345005"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-34500-5_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"29 May 2023","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":"Abu Dhabi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Arab Emirates","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icvns2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.icvns2022.info\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"29","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":"11","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":"38% - 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":"3","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)"}}]}}