{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,14]],"date-time":"2026-07-14T04:02:13Z","timestamp":1784001733841,"version":"3.55.0"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,1,9]],"date-time":"2007-01-09T00:00:00Z","timestamp":1168300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2007,2,8]]},"DOI":"10.1007\/s10479-006-0154-0","type":"journal-article","created":{"date-parts":[[2007,1,8]],"date-time":"2007-01-08T21:02:53Z","timestamp":1168290173000},"page":"205-230","source":"Crossref","is-referenced-by-count":54,"title":["A fast swap-based local search procedure for location problems"],"prefix":"10.1007","volume":"150","author":[{"given":"Mauricio G. C.","family":"Resende","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Renato F.","family":"Werneck","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2007,1,9]]},"reference":[{"key":"154_CR1","doi-asserted-by":"crossref","unstructured":"Arya, V., N. Garg, R. Khandekar, A. Mayerson, K. Munagala, and V. Pandit. (2001). \u201cLocal Search Heuristics for k-Median and Facility Location Problems.\u201d In Proc. 33rd ACM Symposium on the Theory of Computing.","DOI":"10.1145\/380752.380755"},{"key":"154_CR2","unstructured":"Avella, P., A. Sassano, and I. Vasil\u2019ev. (2003). \u201cComputational Study of Large-Scale p-Median Problems.\u201d Technical Report 08-03, DIS\u2014Universit\u00e0 di Roma \u201dLa Sapienza\u201d."},{"key":"154_CR3","doi-asserted-by":"crossref","unstructured":"Avella, P., A. Sassano, and I. Vasil\u2019ev. (2003). \u201cA Heuristic for Large-Scale p-Median Instances.\u201d Electronic Notes in Discrete Mathematics, 13, 1\u20134.","DOI":"10.1016\/S1571-0653(04)00427-5"},{"key":"154_CR4","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/0377-2217(85)90040-2","volume":"21","author":"J.E. Beasley","year":"1985","unstructured":"Beasley, J.E. (1985). \u201cA Note on Solving Large p-Median Problems.\u201d European Journal of Operational Research, 21, 270\u2013273.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"154_CR5","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1287\/opre.1040.0108","volume":"52","author":"O. Briant","year":"2004","unstructured":"Briant, O. and D. Naddef. (2004). \u201cThe Optimal Diversity Management Problem.\u201d Operations Research, 52(4), 515\u2013526.","journal-title":"Operations Research"},{"key":"154_CR6","unstructured":"Cormen, T., C. Leiserson, R. Rivest, and C. Stein. (2001). Introduction to Algorithms, 2nd edn. MIT Press."},{"key":"154_CR7","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1287\/mnsc.23.8.789","volume":"23","author":"G. Cornu\u00e9jols","year":"1977","unstructured":"Cornu\u00e9jols, G., M.L. Fisher, and G.L. Nemhauser. (1977). \u201cLocation of Bank Accounts to Optimize Float: An Analytical Study of Exact and Approximate Algorithms.\u201d Management Science, 23, 789\u2013810.","journal-title":"Management Science"},{"key":"154_CR8","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/S0012-365X(98)00213-1","volume":"194","author":"O. du Merle","year":"1999","unstructured":"du Merle, O., D. Villeneuve, J. Desrosiers, and P. Hansen. (1999). \u201cStabilized Column Generation.\u201d Discrete Mathematics, 194, 229\u2013237.","journal-title":"Discrete Mathematics"},{"key":"154_CR9","doi-asserted-by":"crossref","first-page":"1112","DOI":"10.1287\/opre.28.5.1112","volume":"28","author":"R.D. Galv\u00e3o","year":"1980","unstructured":"Galv\u00e3o, R.D. (1980). \u201cA Dual-Bounded Algorithm for the p-Median Problem.\u201d Operations Research, 28, 1112\u20131121.","journal-title":"Operations Research"},{"issue":"5","key":"154_CR10","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1016\/S0167-8191(03)00043-7","volume":"29","author":"F. Garc\u00eda-L\u00f3pez","year":"2003","unstructured":"Garc\u00eda-L\u00f3pez, F., B. Meli\u00e1n-Batista, J.A. Moreno-P\u00e9rez, and J.M. Moreno-Vega. (2003). \u201cParallelization of the Scatter Search for the p-Median Problem.\u201d Parallel Computing, 29(5), 575\u2013589.","journal-title":"Parallel Computing"},{"key":"154_CR11","unstructured":"Glover, F. (1996). \u201cTabu Search and Adaptive Memory Programming: Advances, Applications and Challenges.\u201d In R.S. Barr, R.V. Helgason, and J.L. Kennington (eds.), Interfaces in Computer Science and Operations Research, Kluwer, pp. 1\u201375."},{"key":"154_CR12","first-page":"653","volume":"39","author":"F. Glover","year":"2000","unstructured":"Glover, F., M. Laguna, and R. Mart\u00ed. (2000). \u201cFundamentals of Scatter Search and Path Relinking.\u201d Control and Cybernetics, 39, 653\u2013684.","journal-title":"Control and Cybernetics"},{"key":"154_CR13","unstructured":"Goodchild, M.F. and V. Noronha. (1983). \u201cLocation-Allocation for Small Computers.\u201d Monograph 8, Department of Geography, University of Iowa."},{"key":"154_CR14","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/S0966-8349(98)00030-8","volume":"5","author":"P. Hansen","year":"1997","unstructured":"Hansen, P. and N. Mladenovi\u0107. (1997). \u201cVariable Neighborhood Search for the p-Median.\u201d Location Science, 5, 207\u2013226.","journal-title":"Location Science"},{"issue":"3","key":"154_CR15","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1023\/A:1011336210885","volume":"7","author":"P. Hansen","year":"2001","unstructured":"Hansen, P., N. Mladenovi\u0107, and D. Perez-Brito. (2001). \u201cVariable Neighborhood Decomposition Search.\u201d Journal of Heuristics, 7(3), 335\u2013350.","journal-title":"Journal of Heuristics"},{"key":"154_CR16","doi-asserted-by":"crossref","first-page":"1273","DOI":"10.1068\/a101273","volume":"10","author":"M.J. Hodgson","year":"1978","unstructured":"Hodgson, M.J. (1978). \u201cToward More Realistic Allocation in Location-Allocation Models: An Interaction Approach.\u201d Environment and Planning A, 10, 1273\u20131285.","journal-title":"Environment and Planning A"},{"issue":"3","key":"154_CR17","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1137\/0137041","volume":"37","author":"O. Kariv","year":"1979","unstructured":"Kariv, O. and L. Hakimi. (1979). \u201cAn Algorithmic Approach to Nework Location Problems, Part II: The p-Medians.\u201d SIAM Journal of Applied Mathematics, 37(3), 539\u2013560.","journal-title":"SIAM Journal of Applied Mathematics"},{"issue":"4","key":"154_CR18","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1287\/mnsc.9.4.643","volume":"9","author":"A.A. Kuehn","year":"1963","unstructured":"Kuehn, A.A. and M.J. Hamburger. (1963). \u201cA Heuristic Program for Locating Warehouses.\u201d Management Science, 9(4), 643\u2013666.","journal-title":"Management Science"},{"key":"154_CR19","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1287\/ijoc.11.1.44","volume":"11","author":"M. Laguna","year":"1999","unstructured":"Laguna, M. and R. Mart\u00ed. (1999). \u201cGRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization.\u201d INFORMS Journal on Computing, 11, 44\u201352.","journal-title":"INFORMS Journal on Computing"},{"issue":"3","key":"154_CR20","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1057\/jors.1964.47","volume":"15","author":"F.E. Maranzana","year":"1964","unstructured":"Maranzana, F.E. (1964). \u201cOn the Location of Supply Points to Minimize Transportation Costs.\u201d Operations Research Quarterly, 15(3), 261\u2013270.","journal-title":"Operations Research Quarterly"},{"issue":"1","key":"154_CR21","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/272991.272995","volume":"8","author":"M. Matsumoto","year":"1998","unstructured":"Matsumoto, M. and T. Nishimura. (1998). \u201cMersenne Twister: A 623-Dimensionally Equidistributed Uniform Pseudorandom Number Generator.\u201d ACM Transactions on Modeling and Computer Simulation, 8(1), 3\u201330.","journal-title":"ACM Transactions on Modeling and Computer Simulation"},{"key":"154_CR22","doi-asserted-by":"crossref","unstructured":"Reinelt, G. (1991). \u201cTSPLIB: A Traveling Salesman Problem Library.\u201d ORSA Journal on Computing, 3, 376\u2013384. http:\/\/www.iwr.uni-heidelberg.de\/groups\/comopt\/software\/TSPLIB95\/ .","DOI":"10.1287\/ijoc.3.4.376"},{"key":"154_CR23","unstructured":"Resende, M.G.C. and C.C. Ribeiro. (2005). \u201cGRASP with Path-Relinking: Recent Advances and Applications.\u201d In T. Ibaraki, K. Nonobe, and M. Yagiura (eds.), Metaheuristics: Progress as Real Problem Solvers, Kluwer. In press."},{"key":"154_CR24","unstructured":"Resende, M.G.C. and R.F. Werneck. (2003). \u201cOn the Implementation of a Swap-Based Local Search Procedure for the p-Median Problem.\u201d In R.E. Ladner (ed.), Proceedings of the Fifth Workshop on Algorithm Engineering and Experiments (ALENEX\u201903), SIAM, pp. 119\u2013127."},{"issue":"1","key":"154_CR25","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1023\/B:HEUR.0000019986.96257.50","volume":"10","author":"M.G.C. Resende","year":"2004","unstructured":"Resende, M.G.C. and R.F. Werneck. (2004). \u201cA Hybrid Heuristic for the p-Median Problem.\u201d Journal of Heuristics, 10(1), 59\u201388.","journal-title":"Journal of Heuristics"},{"key":"154_CR26","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/S0377-2217(96)00141-5","volume":"96","author":"E. Rolland","year":"1996","unstructured":"Rolland. E., D.A. Schilling, and J.R. Current. (1996). \u201cAn Efficient Tabu Search Procedure for the p-Median Problem.\u201d European Journal of Operational Research, 96, 329\u2013342.","journal-title":"European Journal of Operational Research"},{"key":"154_CR27","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1068\/b240059","volume":"24","author":"K.E. Rosing","year":"1997","unstructured":"Rosing, K.E. (1997). \u201cAn Empirical Investigation of the Effectiveness of a Vertex Substitution Heuristic.\u201d Environment and Planning B, 24, 59\u201367.","journal-title":"Environment and Planning B"},{"key":"154_CR28","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0377-2217(96)00100-2","volume":"97","author":"K.E. Rosing","year":"1997","unstructured":"Rosing, K.E. and C.S. ReVelle. (1997). \u201cHeuristic Concentration: Two Stage Solution Construction.\u201d European Journal of Operational Research, 97, 75\u201386.","journal-title":"European Journal of Operational Research"},{"issue":"9","key":"154_CR29","doi-asserted-by":"crossref","first-page":"815","DOI":"10.1057\/jors.1979.192","volume":"30","author":"K.E. Rosing","year":"1979","unstructured":"Rosing, K.E., C.S. ReVelle, and H. Rosing-Vogelaar. (1979). \u201cThe p-Median and its Linear Programming Relaxation: An Approach to Large Problems.\u201d Journal of the Operational Research Society, 30(9), 815\u2013823.","journal-title":"Journal of the Operational Research Society"},{"key":"154_CR30","doi-asserted-by":"crossref","unstructured":"Senne, E.L.F. and L.A.N. Lorena. (2000). \u201cLangrangean\/Surrogate Heuristics for p-Median Problems.\u201d In M. Laguna and J.L. Gonz\u00e1lez-Velarde (eds.), Computing Tools for Modeling, Optimization and Simulation: Interfaces in Computer Science and Operations Research, Kluwer, pp. 115\u2013130.","DOI":"10.1007\/978-1-4615-4567-5_6"},{"key":"154_CR31","unstructured":"Senne, E.L.F. and L.A.N. Lorena. (2002). \u201cStabilizing Column Generation using Lagrangean\/Surrogate Relaxation: An Application to p-Median Location Problems.\u201d European Journal of Operational Research. To appear."},{"key":"154_CR32","doi-asserted-by":"crossref","first-page":"1655","DOI":"10.1016\/j.cor.2003.11.024","volume":"32","author":"E.L.F. Senne","year":"2005","unstructured":"Senne, E.L.F., L.A.N. Lorena, and M.A. Pereira. (2005). \u201cA Branch-and-Price Approach to p-Median Location Problems.\u201d Computers and Operations Research, 32, 1655\u20131664.","journal-title":"Computers and Operations Research"},{"issue":"1","key":"154_CR33","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1023\/A:1021841728075","volume":"9","author":"E.D. Taillard","year":"2003","unstructured":"Taillard, E.D. (2003). \u201cHeuristic Methods for Large Centroid Clustering Problems.\u201d Journal of Heuristics, 9(1), 51\u201374.","journal-title":"Journal of Heuristics"},{"issue":"5","key":"154_CR34","doi-asserted-by":"crossref","first-page":"955","DOI":"10.1287\/opre.16.5.955","volume":"16","author":"M.B. Teitz","year":"1968","unstructured":"Teitz, M.B. and P. Bart. (1968). \u201cHeuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph.\u201d Operations Research, 16(5), 955\u2013961.","journal-title":"Operations Research"},{"key":"154_CR35","doi-asserted-by":"crossref","unstructured":"Thorup M. (2001). \u201cQuick k-Median, k-Center, and Facility Location for Sparse Graphs.\u201d In Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP 2001), Volume 2076 of Lecture Notes in Computer Science, Springer, pp. 249\u2013260.","DOI":"10.1007\/3-540-48224-5_21"},{"key":"154_CR36","first-page":"49","volume":"8","author":"S. Vo\u00df","year":"1996","unstructured":"Vo\u00df, S. (1996). \u201cA Reverse Elimination Approach for the p-Median Problem.\u201d Studies in Locational Analysis, 8, 49\u201358.","journal-title":"Studies in Locational Analysis"},{"key":"154_CR37","first-page":"95","volume":"21","author":"R. Whitaker","year":"1983","unstructured":"Whitaker, R. (1983). \u201cA Fast Algorithm for the Greedy Interchange of Large-Scale Clustering and Median Location Prolems.\u201d INFOR, 21, 95\u2013108.","journal-title":"INFOR"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-006-0154-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-006-0154-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-006-0154-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:07:37Z","timestamp":1559153257000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-006-0154-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,1,9]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,2,8]]}},"alternative-id":["154"],"URL":"https:\/\/doi.org\/10.1007\/s10479-006-0154-0","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,1,9]]}}}