{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T03:37:09Z","timestamp":1768534629742,"version":"3.49.0"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2022,3,3]],"date-time":"2022-03-03T00:00:00Z","timestamp":1646265600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,3,3]],"date-time":"2022-03-03T00:00:00Z","timestamp":1646265600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100014440","name":"Ministerio de Ciencia, Innovaci\u00f3n y Universidades","doi-asserted-by":"publisher","award":["PGC2018-095322-B-C22"],"award-info":[{"award-number":["PGC2018-095322-B-C22"]}],"id":[{"id":"10.13039\/100014440","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100014440","name":"Ministerio de Ciencia, Innovaci\u00f3n y Universidades","doi-asserted-by":"publisher","award":["PGC2018-095322-B-C22"],"award-info":[{"award-number":["PGC2018-095322-B-C22"]}],"id":[{"id":"10.13039\/100014440","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100014440","name":"Ministerio de Ciencia, Innovaci\u00f3n y Universidades","doi-asserted-by":"publisher","award":["PGC2018-095322-B-C22"],"award-info":[{"award-number":["PGC2018-095322-B-C22"]}],"id":[{"id":"10.13039\/100014440","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100012818","name":"Comunidad de Madrid","doi-asserted-by":"publisher","award":["P2018\/TCS-4566"],"award-info":[{"award-number":["P2018\/TCS-4566"]}],"id":[{"id":"10.13039\/100012818","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100012818","name":"Comunidad de Madrid","doi-asserted-by":"publisher","award":["P2018\/TCS-4566"],"award-info":[{"award-number":["P2018\/TCS-4566"]}],"id":[{"id":"10.13039\/100012818","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100012818","name":"Comunidad de Madrid","doi-asserted-by":"publisher","award":["P2018\/TCS-4566"],"award-info":[{"award-number":["P2018\/TCS-4566"]}],"id":[{"id":"10.13039\/100012818","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004561","name":"Ministry of Education and Science of the Republic of Kazakhstan","doi-asserted-by":"publisher","award":["BR10965172"],"award-info":[{"award-number":["BR10965172"]}],"id":[{"id":"10.13039\/501100004561","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1007\/s11590-022-01861-1","type":"journal-article","created":{"date-parts":[[2022,3,3]],"date-time":"2022-03-03T13:04:19Z","timestamp":1646312659000},"page":"2065-2086","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A general variable neighborhood search approach for the minimum load coloring problem"],"prefix":"10.1007","volume":"17","author":[{"given":"Alberto","family":"Herr\u00e1n","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7490-9450","authenticated-orcid":false,"given":"J. Manuel","family":"Colmenar","sequence":"additional","affiliation":[]},{"given":"Nenad","family":"Mladenovi\u0107","sequence":"additional","affiliation":[]},{"given":"Abraham","family":"Duarte","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,3,3]]},"reference":[{"key":"1861_CR1","first-page":"13","volume-title":"International Workshop on Approximation and Online Algorithms","author":"AA Ageev","year":"2003","unstructured":"Ageev, A.A., Fishkin, A.V., Kononov, A.V., Sevastianov, S.V.: Open block scheduling in optical communication networks. In: International Workshop on Approximation and Online Algorithms, pp. 13\u201326. Springer, Berlin (2003)"},{"key":"1861_CR2","doi-asserted-by":"crossref","unstructured":"Ahuja, N., Baltz, A., Doerr, B., P\u00edve\u030ctiv\u00fd, A., Srivastav, A.: On the minimum load coloring problem. J. Discr. Algor. 5, 533\u2013545 (2007)","DOI":"10.1016\/j.jda.2006.09.001"},{"key":"1861_CR3","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/s00453-016-0259-z","volume":"79","author":"F Barbero","year":"2014","unstructured":"Barbero, F., Gutin, G., Jones, M., Sheng, B.: Parameterized and approximation algorithms for load coloring problem. Algorithmica 79, 211\u2013229 (2014)","journal-title":"Algorithmica"},{"key":"1861_CR4","doi-asserted-by":"crossref","unstructured":"Calvo, B., Ceberio, J., Lozano, J.\u00a0A.: Bayesian inference for algorithm ranking analysis. In Proceedings of the Genetic and Evolutionary Computation Conference Companion GECCO \u201918 (pp. 324\u2013325). New York, NY, USA: ACM (2018)","DOI":"10.1145\/3205651.3205658"},{"key":"1861_CR5","doi-asserted-by":"crossref","unstructured":"Calvo, B., Shir, O.\u00a0M., Ceberio, J., Doerr, C., Wang, H., B\u00e4ck, T., Lozano, J.\u00a0A.: Bayesian performance analysis for black-box optimization benchmarking. In Proceedings of the Genetic and Evolutionary Computation Conference Companion GECCO \u201919 (pp. 1789\u20131797). New York, NY, USA: ACM (2019)","DOI":"10.1145\/3319619.3326888"},{"key":"1861_CR6","unstructured":"DIMACS https:\/\/mat.gsia.cmu.edu\/COLOR\/instances.html (2021)"},{"key":"1861_CR7","first-page":"1","volume-title":"Handbook of Heuristics","author":"A Duarte","year":"2016","unstructured":"Duarte, A., Mladenovi\u0107, N., S\u00e1nchez-Oro, J., Todosijevi\u0107, R.: Variable neighborhood descent. In: Mart\u00ed, R., Panos, P., Resende, M.G. (eds.) Handbook of Heuristics, pp. 1\u201327. Springer International Publishing, Cham (2016)"},{"key":"1861_CR8","doi-asserted-by":"publisher","first-page":"2187","DOI":"10.1137\/S0097539796308217","volume":"28","author":"G Even","year":"1999","unstructured":"Even, G., Naor, J., Rao, S., Schieber, B.: Fast approximate graph partitioning algorithms. SIAM J. Comput. 28, 2187\u20132214 (1999)","journal-title":"SIAM J. Comput."},{"key":"1861_CR9","doi-asserted-by":"publisher","first-page":"1968","DOI":"10.1166\/jctn.2013.3156","volume":"10","author":"T Fei","year":"2013","unstructured":"Fei, T., Bo, W., Jin, W., Liu, D.: Artificial bee colony algorithm for the minimum load coloring problem. J. Comput. Theor. Nanosci. 10, 1968\u20131971 (2013)","journal-title":"J. Comput. Theor. Nanosci."},{"key":"1861_CR10","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1990","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Co, USA (1990)"},{"key":"1861_CR11","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1016\/j.ipl.2014.03.008","volume":"114","author":"G Gutin","year":"2014","unstructured":"Gutin, G., Jones, M.: Parameterized algorithms for load coloring problem. Inf. Process. Lett. 114, 446\u2013449 (2014)","journal-title":"Inf. Process. Lett."},{"key":"1861_CR12","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, 449\u2013467 (2001)","journal-title":"Eur. J. Oper. Res."},{"key":"1861_CR13","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-1-4614-6940-7_12","volume-title":"Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques","author":"P Hansen","year":"2014","unstructured":"Hansen, P., Mladenovi\u0107, N.: Variable neighborhood search. In: Burke, E.K., Kendall, G. (eds.) Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques, pp. 313\u2013337. Springer US, Boston, MA (2014)"},{"key":"1861_CR14","doi-asserted-by":"crossref","unstructured":"Hansen, P., Mladenovi\u0107, N., Brimberg, J., P\u00e9rez, J.A.M.: Variable neighborhood search. In: Handbook of Metaheuristics, pp. 57\u201397. Springer, Cham (2019)","DOI":"10.1007\/978-3-319-91086-4_3"},{"key":"1861_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ins.2018.09.063","volume":"476","author":"A Herr\u00e1n","year":"2018","unstructured":"Herr\u00e1n, A., Colmenar, J., Duarte, A.: A variable neighborhood search approach for the vertex bisection problem. Inf. Sci. 476, 1\u201318 (2018)","journal-title":"Inf. Sci."},{"key":"1861_CR16","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1016\/j.asoc.2019.04.033","volume":"80","author":"A Herr\u00e1n","year":"2019","unstructured":"Herr\u00e1n, A., Colmenar, J.M., Duarte, A.: A variable neighborhood search approach for the Hamiltonian p-median problem. Appl. Soft Comput. 80, 603\u2013616 (2019)","journal-title":"Appl. Soft Comput."},{"key":"1861_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2012.10.012","volume":"226","author":"R Mart\u00ed","year":"2013","unstructured":"Mart\u00ed, R., Resende, M.G., Ribeiro, C.C.: Multi-start methods for combinatorial optimization. Eur. J. Oper. Res. 226, 1\u20138 (2013)","journal-title":"Eur. J. Oper. Res."},{"key":"1861_CR18","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/j.ins.2015.07.044","volume":"326","author":"N Mladenovi\u0107","year":"2016","unstructured":"Mladenovi\u0107, N., Todosijevi\u0107, R., Uro\u0161evi\u0107, D.: Less is more: basic variable neighborhood search for minimum differential dispersion problem. Inf. Sci. 326, 160\u2013171 (2016)","journal-title":"Inf. Sci."},{"key":"1861_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, 1097\u20131100 (1997)","journal-title":"Comput. Oper. Res."},{"key":"1861_CR20","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s10732-018-9367-z","volume":"26","author":"J Panadero","year":"2020","unstructured":"Panadero, J., Doering, J., Kizys, R., Juan, A.A., Fito, A.: A variable neighborhood search simheuristic for project portfolio selection under uncertainty. J. Heuristics 26, 353\u2013375 (2020)","journal-title":"J. Heuristics"},{"key":"1861_CR21","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, 2242\u20132252 (2013)","journal-title":"Appl. Soft Comput."},{"key":"1861_CR22","doi-asserted-by":"publisher","first-page":"816","DOI":"10.1016\/j.ejor.2019.01.047","volume":"276","author":"R P\u011bni\u010dka","year":"2019","unstructured":"P\u011bni\u010dka, R., Faigl, J., Saska, M.: Variable neighborhood search for the set orienteering problem and its application to other orienteering problem variants. Eur. J. Oper. Res. 276, 816\u2013825 (2019)","journal-title":"Eur. J. Oper. Res."},{"key":"1861_CR23","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-030-37157-9_5","volume-title":"Network Algorithms, Data Mining, and Applications","author":"A Sifaleras","year":"2020","unstructured":"Sifaleras, A., Konstantaras, I.: A survey on variable neighborhood search methods for supply network inventory. In: Network Algorithms, Data Mining, and Applications, pp. 71\u201380. Springer, Cham (2020)"},{"key":"1861_CR24","volume-title":"WDM Optical Networks: Concepts, Design, and Algorithms","author":"C Siva","year":"2001","unstructured":"Siva, C., Murthy, R., Guruswamy, M.: WDM Optical Networks: Concepts, Design, and Algorithms. Prentice Hall, Prentice (2001)"},{"key":"1861_CR25","doi-asserted-by":"publisher","first-page":"115184","DOI":"10.1016\/j.eswa.2021.115184","volume":"182","author":"NR Uribe","year":"2021","unstructured":"Uribe, N.R., Herr\u00e1n, A., Colmenar, J.M., Duarte, A.: An improved grasp method for the multiple row equal facility layout problem. Exp. Syst. Appl. 182, 115184 (2021)","journal-title":"Exp. Syst. Appl."},{"key":"1861_CR26","doi-asserted-by":"publisher","first-page":"2476","DOI":"10.1166\/jctn.2014.3664","volume":"11","author":"A Ye","year":"2014","unstructured":"Ye, A., Zhang, Z., Zhou, X., Miao, F.: Tabu assisted local search for the minimum load coloring problem. J. Comput. Theor. Nanosci. 11, 2476\u20132480 (2014)","journal-title":"J. Comput. Theor. Nanosci."},{"key":"1861_CR27","doi-asserted-by":"publisher","first-page":"2073","DOI":"10.3390\/math7050475","volume":"7","author":"Z Zhang","year":"2019","unstructured":"Zhang, Z., Li, Z., Qiao, X., Wang, W.: An efficient memetic algorithm for the minimum load coloring problem. Mathematics 7, 2073\u20132078 (2019)","journal-title":"Mathematics"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01861-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-022-01861-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01861-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,30]],"date-time":"2023-10-30T11:04:22Z","timestamp":1698663862000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-022-01861-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,3]]},"references-count":27,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["1861"],"URL":"https:\/\/doi.org\/10.1007\/s11590-022-01861-1","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,3]]},"assertion":[{"value":"9 November 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 February 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 March 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}