{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T15:40:36Z","timestamp":1786981236065,"version":"build-2736575974"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,12,21]],"date-time":"2013-12-21T00:00:00Z","timestamp":1387584000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2015,11]]},"DOI":"10.1007\/s10898-013-0130-6","type":"journal-article","created":{"date-parts":[[2013,12,20]],"date-time":"2013-12-20T05:09:32Z","timestamp":1387516172000},"page":"445-460","source":"Crossref","is-referenced-by-count":27,"title":["An exact method for the discrete $$(r|p)$$ ( r | p ) -centroid problem"],"prefix":"10.1007","volume":"63","author":[{"given":"Ekaterina","family":"Alekseeva","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yury","family":"Kochetov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alexandr","family":"Plyasunov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2013,12,21]]},"reference":[{"key":"130_CR1","unstructured":"Alekseeva, E., Beresnev, V., Kochetov, Y. et al.: Benchmark library: Discrete Location Problems (Russia), http:\/\/math.nsc.ru\/AP\/benchmarks\/Competitive\/p_me_comp_eng.html"},{"key":"130_CR2","doi-asserted-by":"crossref","unstructured":"Alekseeva, E., Kochetov, Y.: Matheuristics and exact methods for the discrete (r|p)-centroid problem. In: Talbi, E.-G. (ed.) Metaheuristics for bi-level optimization. Studies in Computational Intelligence, vol. 482, pp. 189\u2013219. Springer, Berlin (2013)","DOI":"10.1007\/978-3-642-37838-6_7"},{"key":"130_CR3","doi-asserted-by":"crossref","unstructured":"Alekseeva, E., Kochetova, N., Kochetov, Yu., Plyasunov, A.: A heuristic and exact methods for the discrete ( $$r|p$$ r | p )-centroid problem. LNCS 6022, pp. 11\u201322 (2010)","DOI":"10.1007\/978-3-642-12139-5_2"},{"key":"130_CR4","doi-asserted-by":"crossref","unstructured":"Banik, A., Das, S., Maheshwari, A., Smid, M.: The discrete Voronoi game in a simple polygon. LNCS 7936, pp. 197\u2013207 (2013)","DOI":"10.1007\/978-3-642-38768-5_19"},{"issue":"5","key":"130_CR5","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1016\/0305-0548(93)90013-9","volume":"20","author":"O Ben-Ayed","year":"1993","unstructured":"Ben-Ayed, O.: Bilevel linear programming. Comput. Oper. Res. 20(5), 485\u2013501 (1993)","journal-title":"Comput. Oper. Res."},{"key":"130_CR6","first-page":"193","volume":"2","author":"S Benati","year":"1994","unstructured":"Benati, S., Laporte, G.: Tabu search algorithms for the ( $$r|X_p$$ r | X p )-medianoid and ( $$r|p$$ r | p )-centroid problems. Locat. Sci. 2, 193\u2013204 (1994)","journal-title":"Locat. Sci."},{"key":"130_CR7","doi-asserted-by":"crossref","unstructured":"Beresnev, V., Melnikov, A.: Approximate algorithms for the competitive facility location problem. J. Appl. Ind. Math. 5(2), 180\u2013190 (2011)","DOI":"10.1134\/S1990478911020049"},{"key":"130_CR8","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1016\/j.ejor.2007.08.027","volume":"191","author":"CM Campos-Rodr\u00edguez","year":"2008","unstructured":"Campos-Rodr\u00edguez, C.M., Moreno P\u00e9rez, J.A.: Multiple voting location problems. Eur. J. Oper. Res. 191, 437\u2013453 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"130_CR9","doi-asserted-by":"crossref","unstructured":"Campos-Rodr\u00edguez, C.M., Moreno P\u00e9rez, J.A., Santos-Pe\u00f1ate, D.R.: Particle swarm optimization with two swarms for the discrete ( $$r|p$$ r | p )-centroid problem. LNCS 6927, pp. 432\u2013439 (2012)","DOI":"10.1007\/978-3-642-27549-4_55"},{"issue":"1","key":"130_CR10","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/s11750-009-0117-0","volume":"18","author":"CM Campos-Rodr\u00edguez","year":"2010","unstructured":"Campos-Rodr\u00edguez, C.M., Santos-Pe\u00f1ate, D.R., Moreno-P\u00e9rez, J.A.: An exact procedure and LP formulations for the leader-follower location problem. TOP 18(1), 97\u2013121 (2010)","journal-title":"TOP"},{"key":"130_CR11","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/j.endm.2012.10.002","volume":"39","author":"I Davydov","year":"2012","unstructured":"Davydov, I., Kochetov, Y., Carrizosa, E.: VNS heuristic for the ( $$r|p$$ r | p )-centroid problem on the plane. Electron. Notes Discrete Math. 39, 5\u201312 (2012)","journal-title":"Electron. Notes Discrete Math."},{"key":"130_CR12","doi-asserted-by":"crossref","unstructured":"Davydov I., Kochetov Y., Plyasunov A.: On the complexity of the ( $$r|p$$ r | p )-centroid problem in the plane. TOP (2013). doi: 10.1007\/s11750-013-0275-y","DOI":"10.1007\/s11750-013-0275-y"},{"key":"130_CR13","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1111\/j.1538-4632.1984.tb00799.x","volume":"16","author":"A Ghosh","year":"1984","unstructured":"Ghosh, A., Craig, C.: A Location allocation model for facility planning in a competitive environment. Geogr. Anal. 16, 39\u201351 (1984)","journal-title":"Geogr. Anal."},{"key":"130_CR14","unstructured":"Hakimi, S.L.: Locations with spatial interactions: competitive locations and games. In: Mirchandani, P.B., Francis, R.L. (eds.): Discrete Location Theory, pp. 439\u2013478. Wiley-Interscience, New York (1990)"},{"key":"130_CR15","doi-asserted-by":"crossref","first-page":"41","DOI":"10.2307\/2224214","volume":"39","author":"H Hotelling","year":"1929","unstructured":"Hotelling, H.: Stability in competition. Econ. J. 39, 41\u201357 (1929)","journal-title":"Econ. J."},{"issue":"4","key":"130_CR16","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1287\/trsc.22.4.278","volume":"22","author":"P Hansen","year":"1988","unstructured":"Hansen, P., Labb\u00e9, M.: Algorithms for voting and competitive location on a network. Transp. Sci. 22(4), 278\u2013288 (1988)","journal-title":"Transp. Sci."},{"key":"130_CR17","doi-asserted-by":"crossref","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":"130_CR18","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1016\/j.ejor.2010.08.009","volume":"208","author":"H K\u00fc\u00e7\u00fckaudin","year":"2011","unstructured":"K\u00fc\u00e7\u00fckaudin, H., Aras, N., Altinel, I.K.: Competitive facility location problem with attractiveness adjustment of the follower: a bilevel programming model and its solution. Eur. J. Oper. Res. 208, 206\u2013220 (2011)","journal-title":"Eur. J. Oper. Res."},{"key":"130_CR19","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/0-387-25383-1_16","volume-title":"Metaheuristics: Progress as Real Solvers","author":"Y Kochetov","year":"2005","unstructured":"Kochetov, Y., Ivanenko, D.: Computationally difficult instances for the uncapacitated facility location problem. In: Ibaraki, T., et al. (eds.) Metaheuristics: Progress as Real Solvers, pp. 351\u2013367. Springer, Berlin (2005)"},{"key":"130_CR20","first-page":"97","volume-title":"Combinatorial Optimization, Methods and Applications","author":"YA Kochetov","year":"2011","unstructured":"Kochetov, Y.A.: Facility location: discrete models and local search methods. In: Chvatal, V. (ed.) Combinatorial Optimization, Methods and Applications, pp. 97\u2013134. IOS Press, Amsterdam (2011)"},{"issue":"3","key":"130_CR21","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1016\/j.ejor.2011.06.036","volume":"217","author":"D Kress","year":"2012","unstructured":"Kress, D., Pesch, E.: Sequential competitive location on networks. Eur. J. Oper. Res. 217(3), 483\u2013499 (2012)","journal-title":"Eur. J. Oper. Res."},{"key":"130_CR22","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1137\/0604028","volume":"4","author":"N Megiddo","year":"1983","unstructured":"Megiddo, N., Zemel, E., Hakimi, S.: The maximum coverage location problem. SIAM J. Algebraic Discrete Methods 4, 253\u2013261 (1983)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"130_CR23","doi-asserted-by":"crossref","first-page":"654","DOI":"10.1016\/j.ejor.2006.06.039","volume":"181","author":"H Noltemeier","year":"2007","unstructured":"Noltemeier, H., Spoerhase, J., Wirth, H.: Multiple voting location and single voting location on trees. Eur. J. Oper. Res. 181, 654\u2013667 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"130_CR24","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/s10107-003-0468-5","volume":"100","author":"F Plastria","year":"2004","unstructured":"Plastria, F., Carrizosa, E.: Optimal location and design of a competitive facility. Math. Program. Ser. A. 100, 247\u2013265 (2004)","journal-title":"Math. Program. Ser. A."},{"issue":"1","key":"130_CR25","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/j.ejor.2012.07.042","volume":"224","author":"MC Roboredo","year":"2013","unstructured":"Roboredo, M.C., Pessoa, A.A.: A branch-and-cut algorithm for the discrete $$(r|p)$$ ( r | p ) -centroid problem. Eur. J. Oper. Res. 224(1), 101\u2013109 (2013)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"130_CR26","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/j.ejor.2005.02.046","volume":"174","author":"MGC Resende","year":"2006","unstructured":"Resende, M.G.C., Werneck, R.F.: A hybrid multistart heuristic for the uncapacitated facility location problem. Eur. J. Oper. Res. 174(1), 54\u201368 (2006)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"130_CR27","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1111\/j.1467-9787.1994.tb00882.x","volume":"34","author":"D Serra","year":"1994","unstructured":"Serra, D., ReVelle, C.: Market capture by two competitors: the pre-emptive capture problem. J. Reg. Sci. 34(4), 549\u2013561 (1994)","journal-title":"J. Reg. Sci."},{"issue":"47\u201349","key":"130_CR28","doi-asserted-by":"crossref","first-page":"5128","DOI":"10.1016\/j.tcs.2009.08.020","volume":"410","author":"J Spoerhase","year":"2009","unstructured":"Spoerhase, J., Wirth, H.: ( $$r, p$$ r , p )-centroid problems on paths and trees. J. Theor. Comput. Sci. Arch. 410(47\u201349), 5128\u20135137 (2009)","journal-title":"J. Theor. Comput. Sci. Arch."},{"key":"130_CR29","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/j.ejor.2011.12.017","volume":"219","author":"N Saidani","year":"2012","unstructured":"Saidani, N., Chu, F., Chen, H.: Competitive facility location and design with reactions of competitors already in the market. Eur. J. Oper. Res. 219, 9\u201317 (2012)","journal-title":"Eur. J. Oper. Res."},{"key":"130_CR30","doi-asserted-by":"crossref","DOI":"10.1002\/9780470496916","volume-title":"Metaheuristics: From Design to Implementation","author":"E-G Talbi","year":"2009","unstructured":"Talbi, E.-G.: Metaheuristics: From Design to Implementation. Wiley, Chichester (2009)"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-013-0130-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-013-0130-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-013-0130-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:59:05Z","timestamp":1559264345000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-013-0130-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12,21]]},"references-count":30,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,11]]}},"alternative-id":["130"],"URL":"https:\/\/doi.org\/10.1007\/s10898-013-0130-6","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,12,21]]}}}