{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T16:01:29Z","timestamp":1774368089736,"version":"3.50.1"},"reference-count":41,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Computing"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s0167-8191(03)00043-7","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T22:21:32Z","timestamp":1052778092000},"page":"575-589","source":"Crossref","is-referenced-by-count":63,"title":["Parallelization of the scatter search for the p-median problem"],"prefix":"10.1016","volume":"29","author":[{"given":"F\u00e9lix","family":"Garc\u0131\u0301a-L\u00f3pez","sequence":"first","affiliation":[]},{"given":"Bel\u00e9n","family":"Meli\u00e1n-Batista","sequence":"additional","affiliation":[]},{"given":"Jos\u00e9 A","family":"Moreno-P\u00e9rez","sequence":"additional","affiliation":[]},{"given":"J","family":"Marcos Moreno-Vega","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0167-8191(03)00043-7_BIB1","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/0377-2217(85)90040-2","article-title":"A note on solving large p-median problems","volume":"21","author":"Beasley","year":"1985","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0167-8191(03)00043-7_BIB2","unstructured":"C. Brunschen, M. Brorsson, OdinMP\/CCp-A Portable Implementation of OpenMP for C, in: Proceedings of First European Workshop on OpenMP EWOMP99, 1999, pp. 21\u201326"},{"key":"10.1016\/S0167-8191(03)00043-7_BIB3","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1287\/mnsc.23.8.789","article-title":"Location of bank accounts to optimize float: an analytical study of exact and approximate algorithms","volume":"23","author":"Cornuejols","year":"1977","journal-title":"Management Science"},{"key":"10.1016\/S0167-8191(03)00043-7_BIB4","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/S0012-365X(98)00213-1","article-title":"Stabilized column generation","volume":"194","author":"du Merle","year":"1999","journal-title":"Discrete Mathematics"},{"key":"10.1016\/S0167-8191(03)00043-7_BIB5","doi-asserted-by":"crossref","first-page":"992","DOI":"10.1287\/opre.26.6.992","article-title":"A dual-based procedure for uncapacitated facility location","volume":"26","author":"Erlenkotter","year":"1978","journal-title":"Operations Research"},{"key":"10.1016\/S0167-8191(03)00043-7_BIB6","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01096763","article-title":"Greedy randomized adaptive search procedures","volume":"6","author":"Feo","year":"1995","journal-title":"Journal of Global Optimization"},{"key":"10.1016\/S0167-8191(03)00043-7_BIB7","doi-asserted-by":"crossref","first-page":"1112","DOI":"10.1287\/opre.28.5.1112","article-title":"A dual-bounded algorithm for the p-median problem","volume":"28","author":"Galv\u00e3o","year":"1980","journal-title":"Operations Research"},{"key":"10.1016\/S0167-8191(03)00043-7_BIB8","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1023\/A:1015013919497","article-title":"The parallel variable neighborhood search for the p-median problem","volume":"8","author":"Garc\u0131\u0301a-L\u00f3pez","year":"2002","journal-title":"Journal of Heuristics"},{"key":"10.1016\/S0167-8191(03)00043-7_BIB9","series-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0167-8191(03)00043-7_BIB10","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","article-title":"Tabu search-part I","volume":"1","author":"Glover","year":"1989","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0167-8191(03)00043-7_BIB11","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","article-title":"Tabu search-part II","volume":"2","author":"Glover","year":"1990","journal-title":"ORSA Journal on Computing"},{"issue":"3","key":"10.1016\/S0167-8191(03)00043-7_BIB12","first-page":"653","article-title":"Fundamentals of scatter search and path relinking","volume":"39","author":"Glover","year":"2000","journal-title":"Control and Cybernetics"},{"key":"10.1016\/S0167-8191(03)00043-7_BIB13","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1287\/opre.12.3.450","article-title":"Optimum location of switching centers and the absolute centers and the medians of a graph","volume":"12","author":"Hakimi","year":"1964","journal-title":"Operations Research"},{"key":"10.1016\/S0167-8191(03)00043-7_BIB14","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1287\/opre.13.3.462","article-title":"Optimum distribution of switching centers in a communication network and some related graph theoretic problems","volume":"13","author":"Hakimi","year":"1965","journal-title":"Operations Research"},{"key":"10.1016\/S0167-8191(03)00043-7_BIB15","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/S0966-8349(98)00030-8","article-title":"Variable neighborhood search for the p-Median","volume":"5","author":"Hansen","year":"1997","journal-title":"Location Science"},{"key":"10.1016\/S0167-8191(03)00043-7_BIB16","series-title":"Metaheuristics Advances and Trends in Local Search Paradigms for Optimization","first-page":"433","article-title":"An introduction to variable neighborhood search","author":"Hansen","year":"1999"},{"key":"10.1016\/S0167-8191(03)00043-7_BIB17","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","article-title":"Variable neighborhood search: principles and applications","volume":"130","author":"Hansen","year":"2001","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0167-8191(03)00043-7_BIB18","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1023\/A:1011336210885","article-title":"Variable neighborhood decomposition search","volume":"7","author":"Hansen","year":"2001","journal-title":"Journal of Heuristics"},{"key":"10.1016\/S0167-8191(03)00043-7_BIB19","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/0377-2217(85)90012-8","article-title":"A comparison of two dual-based procedures for solving the p-median problem","volume":"20","author":"Hanjoul","year":"1985","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0167-8191(03)00043-7_BIB20","doi-asserted-by":"crossref","first-page":"1273","DOI":"10.1068\/a101273","article-title":"Toward more realistic allocation in location-allocation models: an interaction approach","volume":"10","author":"Hodgson","year":"1978","journal-title":"Environment and Planning A"},{"key":"10.1016\/S0167-8191(03)00043-7_BIB21","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1137\/0137041","article-title":"An algorithmic approach to network location problems, part 2. The p-medians","volume":"37","author":"Kariv","year":"1969","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"10.1016\/S0167-8191(03)00043-7_BIB22","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1287\/mnsc.9.4.643","article-title":"A heuristic program for locating warehouses","volume":"9","author":"Kuehn","year":"1963","journal-title":"Management Science"},{"key":"10.1016\/S0167-8191(03)00043-7_BIB23","series-title":"Handbook of Applied Optimization","first-page":"183","article-title":"Scatter search","author":"Laguna","year":"2002"},{"issue":"6","key":"10.1016\/S0167-8191(03)00043-7_BIB24","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1145\/358080.358103","article-title":"Anomalies in parallel branch-and-bound algorithms","volume":"27","author":"Lai","year":"1984","journal-title":"Communications of the ACM"},{"issue":"10","key":"10.1016\/S0167-8191(03)00043-7_BIB25","doi-asserted-by":"crossref","first-page":"962","DOI":"10.1109\/TC.1985.6312201","article-title":"Performance of parallel branch-and-bound algorithms","volume":"34","author":"Lai","year":"1985","journal-title":"IEEE Transactions on computers C"},{"key":"10.1016\/S0167-8191(03)00043-7_BIB26","first-page":"138","article-title":"On the location of supply points to minimize transportation costs","volume":"12","author":"Maranzana","year":"1964","journal-title":"Operations Research Quarterly"},{"key":"10.1016\/S0167-8191(03)00043-7_BIB27","first-page":"41","article-title":"A chain-interchange heuristic method","volume":"6","author":"Mladenovi\u0107","year":"1996","journal-title":"Yugoslav Journal of Operational Research"},{"key":"10.1016\/S0167-8191(03)00043-7_BIB28","doi-asserted-by":"crossref","first-page":"855","DOI":"10.1287\/mnsc.27.8.855","article-title":"Theory and application of an optimizing procedure for lock box location analysis","volume":"27","author":"Nauss","year":"1981","journal-title":"Management Science"},{"key":"10.1016\/S0167-8191(03)00043-7_BIB29","unstructured":"OpenMP: A proposed Industry Standard API for Shared Memory Programming, White Paper, October 1997. Available from http:\/\/www.openmp.org\/openmp\/mp-documents\/paper\/paper.html"},{"key":"10.1016\/S0167-8191(03)00043-7_BIB30","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","article-title":"TSP-Lib a travelling salesman library","volume":"3","author":"Reinelt","year":"1991","journal-title":"ORSA Journal of Computing"},{"key":"10.1016\/S0167-8191(03)00043-7_BIB31","unstructured":"M.G.C. Resende, R.F. Werneck, A GRASP with path-relinking for the p-median problem, Journal of Heuristics, in press"},{"key":"10.1016\/S0167-8191(03)00043-7_BIB32","unstructured":"M.G.C. Resende, R.F. Werneck, On the implementation of a swap-based local search procedure for the p-median problem, Technical Report TD-5E4QKA, AT&T Labs Research, 2002"},{"key":"10.1016\/S0167-8191(03)00043-7_BIB33","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1068\/b240059","article-title":"An empirical investigation of the effectiveness of a vertex substitution heuristic","volume":"24","author":"Rosing","year":"1997","journal-title":"Environment and Planning B"},{"issue":"9","key":"10.1016\/S0167-8191(03)00043-7_BIB34","doi-asserted-by":"crossref","first-page":"815","DOI":"10.1057\/jors.1979.192","article-title":"The p-median and its linear programming relaxation: an approach to large problems","volume":"30","author":"Rosing","year":"1979","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0167-8191(03)00043-7_BIB35","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0377-2217(96)00100-2","article-title":"Heuristic concentration: two stage solution construction","volume":"97","author":"Rosing","year":"1997","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0167-8191(03)00043-7_BIB36","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/S0377-2217(96)00141-5","article-title":"An efficient tabu search procedure for the p-median problem","volume":"96","author":"Rolland","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0167-8191(03)00043-7_BIB37","series-title":"Computing Tools for Modeling Optimization and Simulation: Interfaces in Computer Science and Operations Research","first-page":"115","article-title":"Langrangean\/surrogate heuristics for p-median problems","author":"Senne","year":"2000"},{"key":"10.1016\/S0167-8191(03)00043-7_BIB38","unstructured":"E.L.F. Senne, L.A.N. Lorena, Stabilizing column generation using Lagrangean\/surrogate relaxation: an application to p-median location problems, European Journal of Operational Research, in press"},{"key":"10.1016\/S0167-8191(03)00043-7_BIB39","doi-asserted-by":"crossref","first-page":"955","DOI":"10.1287\/opre.16.5.955","article-title":"Heuristic methods for estimating the generalized vertex median of a weighted graph","volume":"16","author":"Teitz","year":"1968","journal-title":"Operations Research"},{"key":"10.1016\/S0167-8191(03)00043-7_BIB40","first-page":"49","article-title":"A reverse elimination approach for the p-median problem","volume":"8","author":"Voss","year":"1996","journal-title":"Studies in Locational Analysis"},{"key":"10.1016\/S0167-8191(03)00043-7_BIB41","first-page":"95","article-title":"A fast algorithm for the greedy interchange of large-scale clustering and median location prolems","volume":"21","author":"Whitaker","year":"1983","journal-title":"INFOR"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819103000437?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819103000437?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,23]],"date-time":"2019-03-23T18:20:04Z","timestamp":1553365204000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167819103000437"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":41,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0167819103000437"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(03)00043-7","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}