{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,6]],"date-time":"2026-07-06T04:17:23Z","timestamp":1783311443352,"version":"3.54.6"},"reference-count":28,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T00:00:00Z","timestamp":1667260800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T00:00:00Z","timestamp":1667260800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2022,2,18]],"date-time":"2022-02-18T00:00:00Z","timestamp":1645142400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2022,11]]},"DOI":"10.1016\/j.ejor.2022.02.038","type":"journal-article","created":{"date-parts":[[2022,2,23]],"date-time":"2022-02-23T03:55:14Z","timestamp":1645588514000},"page":"143-158","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":14,"title":["GRASP with strategic oscillation for the <mml:math xmlns:mml=\"https:\/\/2.zoppoz.workers.dev:443\/http\/www.w3.org\/1998\/Math\/MathML\" altimg=\"si20.svg\"><mml:mi>\u03b1<\/mml:mi><\/mml:math>-neighbor <mml:math xmlns:mml=\"https:\/\/2.zoppoz.workers.dev:443\/http\/www.w3.org\/1998\/Math\/MathML\" altimg=\"si21.svg\"><mml:mi>p<\/mml:mi><\/mml:math>-center problem"],"prefix":"10.1016","volume":"303","author":[{"given":"J.","family":"S\u00e1nchez-Oro","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"A.D.","family":"L\u00f3pez-S\u00e1nchez","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"A.G.","family":"Hern\u00e1ndez-D\u00edaz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0002-4532-3124","authenticated-orcid":false,"given":"A.","family":"Duarte","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/j.ejor.2022.02.038_bib0001","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/s11590-006-0031-4","article-title":"TTT plots: A perl program to create time-to-target plots","volume":"1","author":"Aiex","year":"2007","journal-title":"Optimization Letters"},{"issue":"Supplement C","key":"10.1016\/j.ejor.2022.02.038_bib0002","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/j.cor.2015.01.002","article-title":"When centers can fail: A close second opportunity","volume":"62","author":"Albareda-Sambola","year":"2015","journal-title":"Computers & Operations Research"},{"issue":"3","key":"10.1016\/j.ejor.2022.02.038_bib0003","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1007\/s12597-014-0190-5","article-title":"Metaheuristic applications on discrete facility location problems: A survey","volume":"52","author":"Basu","year":"2015","journal-title":"Opsearch"},{"issue":"1","key":"10.1016\/j.ejor.2022.02.038_bib0004","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1080\/01605682.2019.1654940","article-title":"When closest is not always the best: The distributed p-median problem","volume":"72","author":"Brimberg","year":"2021","journal-title":"Journal of the Operational Research Society"},{"issue":"2","key":"10.1016\/j.ejor.2022.02.038_bib0005","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1080\/01605682.2017.1421854","article-title":"Optimal solutions for the continuous p-centre problem and related-neighbour and conditional problems: A relaxation-based algorithm","volume":"70","author":"Callaghan","year":"2019","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/j.ejor.2022.02.038_bib0006","series-title":"Graphical methods for data analysis: 0","author":"Chambers","year":"2017"},{"issue":"3","key":"10.1016\/j.ejor.2022.02.038_bib0007","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/S0020-0190(97)00224-X","article-title":"The p-neighbor k-center problem","volume":"65","author":"Chaudhuri","year":"1998","journal-title":"Information Processing Letters"},{"issue":"1","key":"10.1016\/j.ejor.2022.02.038_bib0008","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/j.ejor.2012.09.041","article-title":"Optimal algorithms for the alpha-neighbor p-center problem","volume":"225","author":"Chen","year":"2013","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2022.02.038_bib0009","series-title":"Network and discrete location","author":"Daskin","year":"1995"},{"key":"10.1016\/j.ejor.2022.02.038_bib0010","series-title":"Location science","first-page":"21","article-title":"The p-median problem","author":"Daskin","year":"2015"},{"key":"10.1016\/j.ejor.2022.02.038_bib0011","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.cor.2016.04.018","article-title":"An adaptive perturbation-based heuristic: An application to the continuous p-centre problem","volume":"75","author":"Elshaikh","year":"2016","journal-title":"Computers & Operations Research"},{"issue":"2","key":"10.1016\/j.ejor.2022.02.038_bib0012","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0167-6377(89)90002-3","article-title":"A probabilistic heuristic for a computationally difficult set covering problem","volume":"8","author":"Feo","year":"1989","journal-title":"Operations Research Letters"},{"issue":"5","key":"10.1016\/j.ejor.2022.02.038_bib0013","doi-asserted-by":"crossref","first-page":"860","DOI":"10.1287\/opre.42.5.860","article-title":"A greedy randomized adaptive search procedure for maximum independent set","volume":"42","author":"Feo","year":"1994","journal-title":"Operations Research"},{"key":"10.1016\/j.ejor.2022.02.038_bib0014","series-title":"Lion","first-page":"79","article-title":"A new local search for the p-center problem based on the critical vertex concept","volume":"vol. 10556","author":"Ferone","year":"2017"},{"issue":"1","key":"10.1016\/j.ejor.2022.02.038_bib0015","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.1475-3995.2009.00663.x","article-title":"An annotated bibliography of GRASP-Part I: Algorithms","volume":"16","author":"Festa","year":"2008","journal-title":"International Transactions in Operational Research"},{"issue":"2","key":"10.1016\/j.ejor.2022.02.038_bib0016","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1111\/j.1475-3995.2009.00664.x","article-title":"An annotated bibliography of GRASP-Part II: Applications","volume":"16","author":"Festa","year":"2009","journal-title":"International Transactions in Operational Research"},{"key":"10.1016\/j.ejor.2022.02.038_bib0017","series-title":"Handbook of combinatorial optimization","first-page":"2093","article-title":"Tabu search","author":"Glover","year":"1998"},{"issue":"3","key":"10.1016\/j.ejor.2022.02.038_bib0018","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1287\/opre.12.3.450","article-title":"Optimum locations of switching centers and the absolute centers and medians of a graph","volume":"12","author":"Hakimi","year":"1964","journal-title":"Operations Research"},{"issue":"1","key":"10.1016\/j.ejor.2022.02.038_bib0019","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/S0304-3975(98)00222-9","article-title":"Fault tolerant k-center problems","volume":"242","author":"Khuller","year":"2000","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"10.1016\/j.ejor.2022.02.038_bib0020","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0020-0190(95)00141-X","article-title":"On a generalization of the p-center problem","volume":"56","author":"Krumke","year":"1995","journal-title":"Information Processing Letters"},{"key":"10.1016\/j.ejor.2022.02.038_bib0021","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/j.cor.2018.12.017","article-title":"GRASP and VNS for solving the p-next center problem","volume":"104","author":"L\u00f3pez-S\u00e1nchez","year":"2019","journal-title":"Computers & Operations Research"},{"issue":"1","key":"10.1016\/j.ejor.2022.02.038_bib0022","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1137\/1012016","article-title":"The m-center problem","volume":"12","author":"Minieka","year":"1970","journal-title":"SIAM Review"},{"issue":"1","key":"10.1016\/j.ejor.2022.02.038_bib0023","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1002\/net.10081","article-title":"Solving the p-center problem with tabu search and variable neighborhood search","volume":"42","author":"Mladenovi\u0107","year":"2003","journal-title":"Networks: An International Journal"},{"issue":"1","key":"10.1016\/j.ejor.2022.02.038_bib0024","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1177\/0160017615600222","article-title":"Maximal coverage location problem: Impacts, significance, and evolution","volume":"39","author":"Murray","year":"2016","journal-title":"International Regional Science Review"},{"issue":"12","key":"10.1016\/j.ejor.2022.02.038_bib0025","doi-asserted-by":"crossref","first-page":"1440","DOI":"10.3390\/electronics8121440","article-title":"A multi-objective parallel iterated greedy for solving the p-center and p-dispersion problem","volume":"8","author":"P\u00e9rez-Pel\u00f3","year":"2019","journal-title":"Electronics"},{"issue":"12","key":"10.1016\/j.ejor.2022.02.038_bib0026","doi-asserted-by":"crossref","first-page":"1233","DOI":"10.1057\/palgrave.jors.2600485","article-title":"A perturbation heuristic for a class of location problems","volume":"48","author":"Salhi","year":"1997","journal-title":"Journal of the Operational Research Society"},{"issue":"Part B","key":"10.1016\/j.ejor.2022.02.038_sbref0027","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/j.cor.2013.11.008","article-title":"Combining intensification and diversification strategies in VNS. An application to the vertex separation problem","volume":"52","author":"S\u00e1nchez-Oro","year":"2014","journal-title":"Computers & Operations Research"},{"issue":"6","key":"10.1016\/j.ejor.2022.02.038_bib0028","doi-asserted-by":"crossref","first-page":"1319","DOI":"10.1007\/s11390-017-1802-3","article-title":"Greedy randomized adaptive search procedure with path-relinking for the vertex p-center problem","volume":"32","author":"Yin","year":"2017","journal-title":"Journal of Computer Science and Technology"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S037722172200159X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S037722172200159X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T12:52:00Z","timestamp":1759841520000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S037722172200159X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,11]]}},"alternative-id":["S037722172200159X"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.ejor.2022.02.038","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2022,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"GRASP with strategic oscillation for the -neighbor -center problem","name":"articletitle","label":"Article Title"},{"value":"European Journal of Operational Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.ejor.2022.02.038","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2022 The Author(s). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}