{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T17:24:20Z","timestamp":1774373060720,"version":"3.50.1"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2014,4,17]],"date-time":"2014-04-17T00:00:00Z","timestamp":1397692800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2016,11]]},"DOI":"10.1007\/s10479-014-1587-5","type":"journal-article","created":{"date-parts":[[2014,4,16]],"date-time":"2014-04-16T18:59:44Z","timestamp":1397674784000},"page":"227-251","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Up- and downgrading the euclidean 1-median problem and knapsack Voronoi diagrams"],"prefix":"10.1007","volume":"246","author":[{"given":"Frank","family":"Plastria","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,4,17]]},"reference":[{"key":"1587_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02959-6","volume-title":"Optima and equilibria","author":"J-P Aubin","year":"1993","unstructured":"Aubin, J.-P. (1993). Optima and equilibria. Berlin: Springer."},{"issue":"1","key":"1587_CR2","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/j.ejor.2010.01.046","volume":"206","author":"RE Burkard","year":"2010","unstructured":"Burkard, R. E., Galavii, M., & Gassner, E. (2010). The inverse Fermat\u2013Weber problem. European Journal of Operational Research, 206(1), 11\u201317.","journal-title":"European Journal of Operational Research"},{"key":"1587_CR3","first-page":"101","volume":"71","author":"E Carrizosa","year":"1995","unstructured":"Carrizosa, E., & Plastria, F. (1995). On minquantile and maxcovering optimisation. Mathematical Programming, 71, 101\u2013112.","journal-title":"Mathematical Programming"},{"key":"1587_CR4","first-page":"1","volume-title":"Facility location: Applications and theory","author":"Z Drezner","year":"2003","unstructured":"Drezner, Z., Klamroth, K., Sch\u00f6bel, A., & Wesolowsky, G. O. (2003). The Weber problem. In Z. Drezner & H. Hamacher (Eds.), Facility location: Applications and theory (pp. 1\u201336). Berlin: Springer."},{"issue":"1","key":"1587_CR5","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1287\/opre.1030.0077","volume":"52","author":"Z Drezner","year":"2004","unstructured":"Drezner, Z., & Suzuki, A. (2004). The big triangle small triangle method for the solution of non-convex facility location problems. Operations Research, 52(1), 128\u2013135.","journal-title":"Operations Research"},{"key":"1587_CR6","volume-title":"Facility layout and location: An analytical approach","author":"RL Francis","year":"1992","unstructured":"Francis, R. L., McGinnis, L. F., & White, J. A. (1992). Facility layout and location: An analytical approach (2nd ed.). Englewood Cliffs (NJ): Prentice Hall.","edition":"2"},{"key":"1587_CR7","unstructured":"Gassner, E. (2007). Up- and downgrading the 1-median in a network, Report 2007\u20132016, TU Graz. http:\/\/www.math.tugraz.at\/fosp\/pdfs\/tugraz_0037"},{"key":"1587_CR8","doi-asserted-by":"crossref","unstructured":"Gassner, E. (2009a). Up- and downgrading the 1-center in a network. European Journal of Operational Research, 198(2), 370\u2013377.","DOI":"10.1016\/j.ejor.2008.09.013"},{"key":"1587_CR9","doi-asserted-by":"crossref","unstructured":"Gassner, E. (2009b). A game-theoretic approach for downgrading the 1-median in the plane with Manhattan metric. Annals of Operations Research, 172(1), 393\u2013404.","DOI":"10.1007\/s10479-009-0641-1"},{"key":"1587_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-56468-0","volume-title":"Fundamentals of convex analysis","author":"J-B Hiriart-Urruty","year":"2001","unstructured":"Hiriart-Urruty, J.-B., & Lemar\u00e9chal, C. (2001). Fundamentals of convex analysis. Berlin: Springer."},{"key":"1587_CR11","first-page":"15","volume":"28","author":"L Kaufman","year":"1988","unstructured":"Kaufman, L., & Plastria, F. (1988). The Weber problem with supply surplus. Belgian Journal of Operations Research, Statistics and Computer Science, 28, 15\u201331.","journal-title":"Belgian Journal of Operations Research, Statistics and Computer Science"},{"key":"1587_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack problems","author":"H Kellerer","year":"2004","unstructured":"Kellerer, H., Pferschy, U., & Pisinger, D. (2004). Knapsack problems. Berlin: Springer."},{"key":"1587_CR13","unstructured":"Klein, R. (2013). Abstract Voronoi diagrams. In Proceedings of the XV Spanish Meeting on Computational Geometry (pp. 55\u201356)"},{"issue":"6","key":"1587_CR14","first-page":"478","volume":"31","author":"D-T Lee","year":"1982","unstructured":"Lee, D.-T. (1982). On $$k$$ k -nearest neighbor Voronoi diagrams in the plane. IEEE Transactions on Computers, 31(6), 478\u2013487.","journal-title":"IEEE Transactions on Computers"},{"issue":"2","key":"1587_CR15","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1016\/j.cor.2009.05.001","volume":"37","author":"AJ Lozano","year":"2010","unstructured":"Lozano, A. J., Mesa, J. A., & Plastria, F. (2010). Finding an Euclidean anti- $$k$$ k -centrum location of a set of points. Computers and Operations Research, 37(2), 292\u2013301.","journal-title":"Computers and Operations Research"},{"key":"1587_CR16","unstructured":"Martello, S., & Toth, P. (1990). Knapsack problems\u2014Algorithms and computer implementations. Chichester: Wiley. http:\/\/www.or.deis.unibo.it\/knapsack.html"},{"key":"1587_CR17","volume-title":"Location theory\u2014A unified approach","author":"S Nickel","year":"2005","unstructured":"Nickel, S., & Puerto, J. (2005). Location theory\u2014A unified approach. Berlin: Springer."},{"key":"1587_CR18","volume-title":"Spatial tesselations","author":"A Okabe","year":"1999","unstructured":"Okabe, A., Boots, B., Sugihara, K., & Chiu, S. N. (1999). Spatial tesselations. Chichester: Wiley."},{"issue":"2","key":"1587_CR19","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0377-2217(92)90244-4","volume":"62","author":"F Plastria","year":"1992","unstructured":"Plastria, F. (1992). GBSSS: the generalized big square small square method for planar single facility location. European Journal of Operational Research, 62(2), 163\u2013174.","journal-title":"European Journal of Operational Research"},{"key":"1587_CR20","first-page":"229","volume-title":"Facility location: A survey of applications and methods","author":"F Plastria","year":"1995","unstructured":"Plastria, F. (1995). Continuous location problems, Chap. 11. In Drezner (Ed.), Facility location: A survey of applications and methods (pp. 229\u2013266). Berlin: Springer."},{"key":"1587_CR21","series-title":"International Series in Operations Research and Management Science","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/978-1-4419-7572-0_16","volume-title":"Foundations of location analysis","author":"F Plastria","year":"2011","unstructured":"Plastria, F. (2011). The Weiszfeld algorithm: Proof, amendments and extensions, Chap. 16. In H. A. Eiselt & V. Marianov (Eds.), Foundations of location analysis (pp. 357\u2013389)., International Series in Operations Research and Management Science New York: Springer."},{"issue":"2","key":"1587_CR22","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1007\/s11750-008-0056-1","volume":"16","author":"F Plastria","year":"2008","unstructured":"Plastria, F., & Elosmani, M. (2008). On the convergence of the Weiszfeld algorithm for continuous single facility location-allocation problems. TOP, 16(2), 388\u2013406.","journal-title":"TOP"},{"issue":"2","key":"1587_CR23","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/s11750-011-0185-9","volume":"21","author":"F Plastria","year":"2013","unstructured":"Plastria, F., & Elosmani, M. (2013). Continuous location of an assembly station. TOP, 21(2), 323\u2013340.","journal-title":"TOP"},{"key":"1587_CR24","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex analysis","author":"T Rockafellar","year":"1970","unstructured":"Rockafellar, T. (1970). Convex analysis. Princeton, NJ: Princeton University Press."},{"key":"1587_CR25","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1007\/s10898-009-9502-3","volume":"48","author":"A Sch\u00f6bel","year":"2010","unstructured":"Sch\u00f6bel, A., & Scholz, D. (2010). The theoretical and empirical rate of convergence for geometric branch-and-bound methods. Journal of Global Optimization, 48, 473\u2013495.","journal-title":"Journal of Global Optimization"},{"key":"1587_CR26","unstructured":"Weber, A. (1909). \u00dcber den Standort der Industrien T\u00fcbingen: Verlag Mohr, (English trasns. by C. J. Friedrich. (1929). Theory of the location of industries. Chicago: University of Chicago Press)"},{"key":"1587_CR27","first-page":"355","volume":"43","author":"E Weiszfeld","year":"1937","unstructured":"Weiszfeld, E. (1937). Sur le point pour lequel la somme des distances de $$n$$ n points donn\u00e9s est minimum. Tohoku Mathematical Journal (first series), 43, 355\u2013386.","journal-title":"Tohoku Mathematical Journal (first series)"},{"issue":"1","key":"1587_CR28","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/s10479-008-0352-z","volume":"167","author":"E Weiszfeld","year":"2009","unstructured":"Weiszfeld, E., & Plastria, F. (2009). On the point for which the sum of the distances to $${n}$$ n given points is minimum (translated and annotated by F. Plastria). Annals of Operations Research, 167(1), 7\u201341.","journal-title":"Annals of Operations Research"},{"key":"1587_CR29","first-page":"5","volume":"1","author":"GO Wesolowski","year":"1993","unstructured":"Wesolowski, G. O. (1993). The Weber problem: History and perspectives. Location Science, 1, 5\u201323.","journal-title":"Location Science"},{"issue":"3","key":"1587_CR30","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1080\/02331939408843986","volume":"30","author":"Wu Shiquan","year":"1994","unstructured":"Shiquan, Wu. (1994). A polynomial time algorithm for solving the Fermat\u2013Weber location problem with mixed norms. Optimization, 30(3), 227\u2013234.","journal-title":"Optimization"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-014-1587-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-014-1587-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-014-1587-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-014-1587-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:09:49Z","timestamp":1559153389000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-014-1587-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4,17]]},"references-count":30,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2016,11]]}},"alternative-id":["1587"],"URL":"https:\/\/doi.org\/10.1007\/s10479-014-1587-5","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,4,17]]}}}