{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,15]],"date-time":"2026-02-15T21:20:43Z","timestamp":1771190443157,"version":"3.50.1"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,6,2]],"date-time":"2006-06-02T00:00:00Z","timestamp":1149206400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2007,1]]},"DOI":"10.1007\/s10107-005-0700-6","type":"journal-article","created":{"date-parts":[[2006,6,2]],"date-time":"2006-06-02T15:30:40Z","timestamp":1149262240000},"page":"89-114","source":"Crossref","is-referenced-by-count":144,"title":["Computational study of large-scale p-Median problems"],"prefix":"10.1007","volume":"109","author":[{"given":"Pasquale","family":"Avella","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonio","family":"Sassano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Igor","family":"Vasil'ev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,6,2]]},"reference":[{"key":"700_CR1","unstructured":"OR\u2013Library. Available at the web address http:\/\/mscmga.ms.ic.ac.uk\/info.html ."},{"key":"700_CR2","unstructured":"Tsplib. Available at the web address http:\/\/www.iwr.uni-heidelberg.de\/groups\/comopt\/software\/TSPLIB95\/ ."},{"key":"700_CR3","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/PL00011405","volume":"89","author":"Avella","year":"2001","unstructured":"Avella, P., Sassano, A.: On the p-median polytope. Mathematical Programming, 89, 395\u2013411 (2001)","journal-title":"Mathematical Programming,"},{"key":"700_CR4","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/s101070050002","volume":"87","author":"Barahona","year":"2000","unstructured":"Barahona, F., Anbil, R.: The volume algorithm: producing primal solutions with a subgradient algorithm. Mathematical Programming, 87, 385\u2013399 (2000)","journal-title":"Mathematical Programming,"},{"key":"700_CR5","unstructured":"Barahona, F., Chudak, F.: Solving large scale uncapacitated facility location problems. In: Pardalos, P. (ed.), Approximation and Complexity in Numerical Optimization, pp. 48\u201362, 2000"},{"key":"700_CR6","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/0377-2217(85)90040-2","volume":"21","author":"Beasley","year":"1985","unstructured":"Beasley, J.E.: A note on solving large scale p-median problems. EJOR, 21, 270\u2013273 (1985)","journal-title":"EJOR,"},{"key":"700_CR7","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/0377-2217(93)90118-7","volume":"65","author":"Beasley","year":"1993","unstructured":"Beasley, J.E.: Lagrangean heuristics for location problems. EJOR, 65, 383\u2013399 (1993)","journal-title":"EJOR,"},{"key":"700_CR8","unstructured":"Bradley, P.S., Mangasarian, O.L.: Feature selection via concave minimization and support vector machines. In: Shavlik, J. (ed.), Machine Learning Proceedings of the Fifteenth International Conference (ICML'98), San Francisco, California, pp. 82\u201390, 1998"},{"key":"700_CR9","doi-asserted-by":"crossref","unstructured":"Briant, O., Naddef, D.: The optimal diversity management problem. accepted at Operations Research, 52 (4), (2004)","DOI":"10.1287\/opre.1040.0108"},{"key":"700_CR10","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1023\/A:1018982914742","volume":"96","author":"Chiyoshi","year":"2000","unstructured":"Chiyoshi, F., Galvao, D.: A statistical analysis of simulated annealing applied to the p-median problem. Annals of Operations Research, 96, 61\u201374 (2000)","journal-title":"Annals of Operations Research,"},{"key":"700_CR11","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1016\/0377-2217(82)90160-6","volume":"10","author":"Christofides","year":"1982","unstructured":"Christofides, N., Beasley, J.E.: A tree search algorithm for the p-median problem. EJOR, 10, 196\u2013204 (1982)","journal-title":"EJOR,"},{"key":"700_CR12","doi-asserted-by":"crossref","unstructured":"Chudak, F.A.: Improved approximation algorithms for the uncapacitated facility location problem. PhD thesis, Cornell University, 1998","DOI":"10.1007\/3-540-69346-7_14"},{"key":"700_CR13","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1287\/mnsc.23.8.789","volume":"23","author":"Cornuejols","year":"1977","unstructured":"Cornuejols, G., Fisher, M.L., Nemhauser, G.L.: Location of bank accounts to optimize float : An analytic study of exact and approximate algorithms. Management Science, 23, 789\u2013810 (1977)","journal-title":"Management Science,"},{"key":"700_CR14","unstructured":"Correa, E.S., Steiner, M.T.A., Freitas, A.A., Carnieri, C.: A genetic algorithm for the p-median problem. In: Procedings of 2001 Genetic and Evolutionary Computation Conf. (GECCO-2001), pp. 1268\u20131275, 2001"},{"key":"700_CR15","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1023\/B:HEUR.0000026897.40171.1a","volume":"10","author":"Crainic","year":"3","unstructured":"Crainic, T.G., Gendreau, M., Hansen, P., Mladenovic, N.: Cooperative parallel variable neighborhood search for the p-median. Journal of Heuristics, 10 (3), 293\u2013314 (2004)","journal-title":"Journal of Heuristics,"},{"key":"700_CR16","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/S0012-365X(98)00213-1","volume":"194","author":"Merle","year":"1999","unstructured":"du Merle, O., Villeneuve, D., Desrosiers, J., Hansen, P.: Stabilized column generation. discrete mathematics. Discrete Mathematics, 194, 229\u2013237 (1999)","journal-title":"discrete mathematics. Discrete Mathematics,"},{"key":"700_CR17","unstructured":"Erkut, E., Bozkaya, B., Zhang, J.: An effective genetic algorithm for the p-median problem. Paper presented at INFORMS conference in Dallas, 1997"},{"key":"700_CR18","first-page":"29","volume":"1","author":"Fung","year":"15","unstructured":"Fung, G., Mangasarian, O.L.: Semi-supervised support vector machines for unlabeled data classification. Optimization Methods and Software, 1 (15), 29\u201344 (2000)","journal-title":"Optimization Methods and Software,"},{"key":"700_CR19","doi-asserted-by":"crossref","first-page":"1112","DOI":"10.1287\/opre.28.5.1112","volume":"28","author":"Galvao","year":"1980","unstructured":"Galvao, R.D.: A dual-bounded algorithm for the p-median problem, operations research. Operations Research, 28, 1112\u20131121 (1980)","journal-title":"Operations Research,"},{"key":"700_CR20","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1023\/A:1015013919497","volume":"8","author":"Garcia-Lopez","year":"3","unstructured":"Garcia-Lopez, F., Melian-Batista, B., Moreno-Perez, J.A., Moreno-Vega, J.M.: The parallel variable neighborhood search for the p-median problem. Journal of Heuristics, 8 (3), 375\u2013388 (2002)","journal-title":"Journal of Heuristics,"},{"key":"700_CR21","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1016\/S0167-8191(03)00043-7","volume":"29","author":"Garcia-Lopez","year":"3","unstructured":"Garcia-Lopez, F., Melian-Batista, B., Moreno-Perez, J.A., Moreno-Vega, J.M.: Parallelization of the scatter search for the p-median problem. Parallel Computing, 29 (3), 575\u2013589 (2003)","journal-title":"Parallel Computing,"},{"key":"700_CR22","first-page":"183","volume":"25","author":"Garfinkel","year":"1974","unstructured":"Garfinkel, R.S., Neebe, A.W., Rao, M.R.: An algorithm for the m-median plant location problem. Transportation Science, 25, 183\u2013187 (1974)","journal-title":"Transportation Science,"},{"key":"700_CR23","doi-asserted-by":"crossref","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Springer, Berlin Heidelberg New York, 1993","DOI":"10.1007\/978-3-642-78240-4"},{"key":"700_CR24","first-page":"191","volume":"79","author":"Hansen","year":"1997","unstructured":"Hansen, P., Jaumard, B.: Cluster analysis and mathematical programming. Mathematical Programming, 79, 191\u2013215 (1997)","journal-title":"Mathematical Programming,"},{"key":"700_CR25","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/S0966-8349(98)00030-8","volume":"5","author":"Hansen","year":"1997","unstructured":"Hansen, P., Mladenovic, N.: Variable neighbourhood search for the p-median. Location Science, 5, 207\u2013226 (1997)","journal-title":"Location Science,"},{"key":"700_CR26","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1023\/A:1011336210885","volume":"7","author":"Hansen","year":"2001","unstructured":"Hansen, P., Mladenovic, N., Perez-Brito, D.: Variable neighbourhood decomposition search. Journal of Heuristics, 7, 335\u2013350 (2001)","journal-title":"Journal of Heuristics,"},{"key":"700_CR27","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1287\/mnsc.39.6.657","volume":"39","author":"Hoffman","year":"6","unstructured":"Hoffman, K., Padberg, M.: Solving airline crew scheduling problems by branch-and-cut. Management Science, 39 (6), 657\u2013682 (1993)","journal-title":"Management Science,"},{"key":"700_CR28","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/BF02027381","volume":"6","author":"Hosage","year":"1986","unstructured":"Hosage, C.M., Goodchild, M.F.: Discrete space location-allocation solutions from genetic algorithms. Annals of Operational Research, 6, 35\u201346 (1986)","journal-title":"Annals of Operational Research,"},{"key":"700_CR29","first-page":"539","volume":"37","author":"Kariv","year":"3","unstructured":"Kariv, O., Hakimi, L.: An algorithmic approach to network location problems. ii: the p-medians. Operations Research, 37 (3), 539\u2013560 (1979)","journal-title":"ii: the p-medians. Operations Research,"},{"key":"700_CR30","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/BF01299447","volume":"3","author":"Mannino","year":"4","unstructured":"Mannino, C., Sassano, A.: An exact algorithm for the maximum stable set problem. Computational Optimization and Applications, 3 (4), 243\u2013258 (1994)","journal-title":"Computational Optimization and Applications,"},{"key":"700_CR31","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0377-2217(85)90096-7","volume":"21","author":"Mirchandani","year":"1995","unstructured":"Mirchandani, P.B., Oudjit, A., Wong, R.T.: Multidimensional extensions and a nested dual approach for the m-median problem. EJOR, 21, 121\u2013137 (1995)","journal-title":"EJOR,"},{"key":"700_CR32","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1287\/mnsc.25.4.329","volume":"25","author":"Mulvey","year":"1979","unstructured":"Mulvey, J.M., Crowder, H.P.: Cluster analysis: an application of lagrangian relaxation. Management Science, 25, 329\u2013340 (1979)","journal-title":"Management Science,"},{"key":"700_CR33","doi-asserted-by":"crossref","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Willey, 1988","DOI":"10.1002\/9781118627372"},{"key":"700_CR34","doi-asserted-by":"crossref","first-page":"622","DOI":"10.1080\/01621459.1971.10482319","volume":"6","author":"Rao","year":"1971","unstructured":"Rao, M.R.: Cluster analysis and mathematical programming. Journal of the American Statistical Association, 6, 622\u2013626 (1971)","journal-title":"Journal of the American Statistical Association,"},{"key":"700_CR35","unstructured":"Resende, M.G.C., Werneck, R.F.: On the implementation of a swap-based local search procedure for the p-median problem. In: Ladner, R.E. (ed.), Proceedings of the 5th Workshop on Algorithm Engineering and Experiments (ALENEX'03), pp. 119\u2013127, 2003"},{"key":"700_CR36","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1023\/B:HEUR.0000019986.96257.50","volume":"10","author":"Resende","year":"1","unstructured":"Resende, M.G.C., Werneck, R.F.: A hybrid heuristic for the p-median problem. Journal of Heuristics, 10 (1), 59\u201388 (2004)","journal-title":"Journal of Heuristics,"},{"key":"700_CR37","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/S0377-2217(96)00141-5","volume":"96","author":"Rolland","year":"1996","unstructured":"Rolland, E., Schilling, D.A., Current, J.R.: An efficient tabu search procedure for the p-median problem. EJOR, 96, 329\u2013342 (1996)","journal-title":"EJOR,"},{"key":"700_CR38","unstructured":"Senne, E.L.F., Lorena, L.A.N.: Lagrangean\/surrogate heuristics for p-median problems. In: Laguna, M., Gonzalez-Velarde, J.L., (eds.), Computing Tools for Modeling, Optimization and Simulation: Interfaces in Computer Science and Operations Research, Kluwer Academic Publishers, pp. 115\u2013130, 2001"},{"key":"700_CR39","unstructured":"Senne, E.L.F., Lorena, L.A.N.: Stabilizing column generation using lagrangean\/surrogate relaxation: an application to p-median location problems. EURO 2001 - THE EUROPEAN OPERATIONAL RESEARCH CONFERENCE - Erasmus University Rotterdam, July 9\u201311, 2001"},{"key":"700_CR40","doi-asserted-by":"crossref","unstructured":"Senne, E.L.F., Lorena, L.A.N., Pereira, M.A.: A branch-and-price approach to p-median location problems. accepted in Computers and Operations Research, 2004","DOI":"10.1016\/j.cor.2003.11.024"},{"key":"700_CR41","doi-asserted-by":"crossref","first-page":"955","DOI":"10.1287\/opre.16.5.955","volume":"16","author":"Teitz","year":"1968","unstructured":"Teitz, M.B., Bart, P.: Heuristic methods for estimating the generalized vertex median of a weighted graph. Operations Research, 16, 955\u2013961 (1968)","journal-title":"Operations Research,"},{"key":"700_CR42","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1080\/01621459.1969.10500990","volume":"6","author":"Vinod","year":"1969","unstructured":"Vinod, H.D.: Integer programming and the theory of groups. Journal of the American Statistical Association, 6, 506\u2013519 (1969)","journal-title":"Journal of the American Statistical Association,"},{"key":"700_CR43","first-page":"95","volume":"21","author":"Whitaker","year":"1983","unstructured":"Whitaker, R.A.: A fast algorithm for the greedy interchange for large-scale clustering and median location problems. INFORS, 21, 95\u2013108 (1983)","journal-title":"INFORS,"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-005-0700-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-005-0700-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-005-0700-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:50:00Z","timestamp":1559123400000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-005-0700-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,6,2]]},"references-count":43,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,1]]}},"alternative-id":["700"],"URL":"https:\/\/doi.org\/10.1007\/s10107-005-0700-6","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,6,2]]}}}