{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T02:50:21Z","timestamp":1777603821102,"version":"3.51.4"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,1,13]],"date-time":"2020-01-13T00:00:00Z","timestamp":1578873600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,13]],"date-time":"2020-01-13T00:00:00Z","timestamp":1578873600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2020,4]]},"DOI":"10.1007\/s10732-019-09432-x","type":"journal-article","created":{"date-parts":[[2020,1,13]],"date-time":"2020-01-13T12:02:57Z","timestamp":1578916977000},"page":"249-268","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Basic variable neighborhood search for the minimum sitting arrangement problem"],"prefix":"10.1007","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6247-5269","authenticated-orcid":false,"given":"Eduardo G.","family":"Pardo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonio","family":"Garc\u00eda-S\u00e1nchez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Sevaux","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4532-3124","authenticated-orcid":false,"given":"Abraham","family":"Duarte","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,1,13]]},"reference":[{"key":"9432_CR1","unstructured":"Ben\u00edtez, F., Aracena, J., Thraves, C.: The sitting closer to friends than enemies problem in the circumference. Technical report (2018). arXiv:1811.02699"},{"issue":"9","key":"9432_CR2","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C Bron","year":"1973","unstructured":"Bron, C., Kerbosch, J.: Algorithm 457: finding all cliques of an undirected graph. Commun. ACM 16(9), 575\u2013577 (1973). ISSN 0001-0782","journal-title":"Commun. ACM"},{"key":"9432_CR3","volume-title":"Handbook of Combinatorial Optimization","author":"RE Burkard","year":"1998","unstructured":"Burkard, R.E., \u00c7ela, E., Pardalos, P.M., Pitsoulis, L.S.: The quadratic assignment problem. In: Du, D.-Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization. Springer, Boston, MA (1998)"},{"key":"9432_CR4","unstructured":"Cygan, M., Pilipczuk, M., Pilipczuk, M., Wojtaszczyk, J.O.: Sitting closer to friends than enemies, revisited. In: Proceedings of the 37th International Conference on Mathematical Foundations of Computer Science, MFCS\u201912, pp. 296\u2013307, Berlin, Heidelberg (2012). Springer-Verlag. ISBN 978-3-642-32588-5"},{"issue":"2","key":"9432_CR5","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1007\/s00224-014-9558-4","volume":"56","author":"M Cygan","year":"2015","unstructured":"Cygan, M., Pilipczuk, M., Pilipczuk, M., Wojtaszczyk, J.O.: Sitting closer to friends than enemies, revisited. Theory Comput. Syst. 56(2), 394\u2013405 (2015)","journal-title":"Theory Comput. Syst."},{"issue":"3","key":"9432_CR6","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/s10898-014-0213-z","volume":"63","author":"A Duarte","year":"2015","unstructured":"Duarte, A., Pantrigo, J.J., Pardo, E.G., Mladenovi\u0107, N.: Multi-objective variable neighborhood search: an application to combinatorial optimization problems. J. Glob. Optim. 63(3), 515\u2013536 (2015)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"9432_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."},{"issue":"2","key":"9432_CR8","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"TA Feo","year":"1995","unstructured":"Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. J. Glob. Optim. 6(2), 109\u2013133 (1995)","journal-title":"J. Glob. Optim."},{"issue":"3","key":"9432_CR9","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s13675-016-0075-x","volume":"5","author":"N Hansen","year":"2017","unstructured":"Hansen, N., Mladenovi\u0107, P., Todosijevi\u0107, R., Hanafi, S.: Variable neighborhood search: basics and variants. EURO J. Comput. Optim. 5(3), 423\u2013454 (2017). ISSN 2192-4414","journal-title":"EURO J. Comput. Optim."},{"key":"9432_CR10","first-page":"313","volume-title":"Search Methodologies","author":"Pierre Hansen","year":"2013","unstructured":"Hansen, P., Mladenovi\u0107, N.: Variable Neighborhood Search, pp. 313\u2013337. Springer US, Boston (2014). ISBN 978-1-4614-6940-7"},{"key":"9432_CR11","unstructured":"Harary, F.: Graph Theory. In: Addison-Wesley Series in Mathematics. Addison Wesley, Reading (1969)"},{"key":"9432_CR12","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"Richard M. Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility Among Combinatorial Problems, pp. 85\u2013103. Springer US, Boston (1972). ISBN 978-1-4684-2001-2"},{"key":"9432_CR13","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":"Anne-Marie Kermarrec","year":"2011","unstructured":"Kermarrec, A.-M., Thraves, C.: Can Everybody Sit Closer to Their Friends Than Their Enemies? pp. 388\u2013399. Springer, Berlin (2011). ISBN 978-3-642-22993-0"},{"key":"9432_CR14","unstructured":"Kermarrec, A.-M., Thraves, C.: Signed graph embedding: when everybody can sit closer to friends than enemies. CoRR (2014). arXiv:1405.5023"},{"issue":"12","key":"9432_CR15","doi-asserted-by":"publisher","first-page":"1217","DOI":"10.1016\/S0305-0548(98)00104-X","volume":"26","author":"M Laguna","year":"1999","unstructured":"Laguna, M., Mart\u00ed, R., Campos, V.: Intensification and diversification with elite tabu search solutions for the linear ordering problem. Comput. Oper. Res. 26(12), 1217\u20131230 (1999). ISSN 0305-0548","journal-title":"Comput. Oper. Res."},{"key":"9432_CR16","unstructured":"Leskovec, J., Huttenlocher, D., Kleinberg, J.: Signed networks in social media. In: Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, CHI \u201910, pp. 1361\u20131370, New York, NY (2010a). ACM. ISBN 978-1-60558-929-9"},{"key":"9432_CR17","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Huttenlocher, D., Kleinberg, J.: Predicting positive and negative links in online social networks. In: Proceedings of the 19th International Conference on World Wide Web, WWW\u201910, pp. 641\u2013650, New York, NY (2010b). ACM. ISBN 978-1-60558-799-8","DOI":"10.1145\/1772690.1772756"},{"issue":"6","key":"9432_CR18","doi-asserted-by":"publisher","first-page":"919","DOI":"10.1007\/s10732-012-9213-7","volume":"18","author":"M Lozano","year":"2012","unstructured":"Lozano, M., Duarte, A., Gort\u00e1zar, F., Mart\u00ed, R.: Variable neighborhood search with ejection chains for the antibandwidth problem. J. Heuristics 18(6), 919\u2013938 (2012)","journal-title":"J. Heuristics"},{"issue":"11","key":"9432_CR19","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."},{"issue":"1","key":"9432_CR20","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":"9432_CR21","doi-asserted-by":"crossref","unstructured":"Pardalos, P.M., Rendl, F., Wolkowicz, H.: The quadratic assignment problem: a survey and recent developments. In: Proceedings of the DIMACS Workshop on Quadratic Assignment Problems, volume 16 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pp. 1\u201342. American Mathematical Society (1994)","DOI":"10.1090\/dimacs\/016\/01"},{"issue":"2","key":"9432_CR22","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. Combin. Optim. 29(2), 451\u2013471 (2015). ISSN 1573-2886","journal-title":"J. Combin. Optim."},{"key":"9432_CR23","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. (eds.) Handbook of Heuristics. Springer, Cham (2016)"},{"issue":"5","key":"9432_CR24","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."},{"issue":"1","key":"9432_CR25","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/j.jalgor.2004.10.004","volume":"60","author":"I Safro","year":"2006","unstructured":"Safro, I., Ron, D., Brandt, A.: Graph minimum linear arrangement by multilevel weighted edge contractions. J. Algorithms 60(1), 24\u201341 (2006). ISSN 0196-6774","journal-title":"J. Algorithms"},{"issue":"Part B(0)","key":"9432_CR26","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(Part B(0)), 209\u2013219 (2014)","journal-title":"Comput. Oper. Res."},{"issue":"31","key":"9432_CR27","doi-asserted-by":"publisher","first-page":"13636","DOI":"10.1073\/pnas.1004008107","volume":"107","author":"M Szell","year":"2010","unstructured":"Szell, M., Lambiotte, R., Thurner, S.: Multirelational organization of large-scale social networks in an online world. Proc. Natl. Acad. Sci. 107(31), 13636\u201313641 (2010)","journal-title":"Proc. Natl. Acad. Sci."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-019-09432-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-019-09432-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-019-09432-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,12]],"date-time":"2021-01-12T21:48:54Z","timestamp":1610488134000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-019-09432-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,13]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,4]]}},"alternative-id":["9432"],"URL":"https:\/\/doi.org\/10.1007\/s10732-019-09432-x","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1,13]]},"assertion":[{"value":"27 September 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 July 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 December 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 January 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}