{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T21:09:31Z","timestamp":1778792971924,"version":"3.51.4"},"reference-count":26,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2002,6,1]],"date-time":"2002-06-01T00:00:00Z","timestamp":1022889600000},"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":["Operations Research Letters"],"published-print":{"date-parts":[[2002,6]]},"DOI":"10.1016\/s0167-6377(02)00121-9","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T19:55:37Z","timestamp":1034625337000},"page":"149-158","source":"Crossref","is-referenced-by-count":59,"title":["Algorithmic results for ordered median problems"],"prefix":"10.1016","volume":"30","author":[{"given":"J\u00f6rg","family":"Kalcsics","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Nickel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Justo","family":"Puerto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arie","family":"Tamir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(02)00121-9_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02579338","article-title":"Sorting in clogn parallel steps","volume":"3","author":"Ajtai","year":"1983","journal-title":"Combinatorica"},{"key":"10.1016\/S0167-6377(02)00121-9_BIB2","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1142\/S0218195900000292","article-title":"Optimal facility location under various distance functions","volume":"10","author":"Bespamyatnikh","year":"2000","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"10.1016\/S0167-6377(02)00121-9_BIB3","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF02684332","article-title":"A linear algorithm for the pos\/neg-weighted 1-median problem on a cactus","volume":"60","author":"Burkard","year":"1998","journal-title":"Computing"},{"key":"10.1016\/S0167-6377(02)00121-9_BIB4","series-title":"Complexity in Numerical Optimization","first-page":"74","article-title":"Maximizing concave functions in fixed dimension","author":"Cohen","year":"1993"},{"key":"10.1016\/S0167-6377(02)00121-9_BIB5","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1145\/7531.7537","article-title":"Slowing down sorting networks to obtain faster algorithms","volume":"34","author":"Cole","year":"1987","journal-title":"J. Assoc. Comput. Math."},{"key":"10.1016\/S0167-6377(02)00121-9_BIB6","doi-asserted-by":"crossref","first-page":"628","DOI":"10.1287\/opre.24.4.628","article-title":"Convex location problems on tree networks","volume":"24","author":"Dearing","year":"1976","journal-title":"Oper. Res."},{"key":"10.1016\/S0167-6377(02)00121-9_BIB7","series-title":"Algorithms in Combinatorial Geometry","author":"Edelsbrunner","year":"1987"},{"key":"10.1016\/S0167-6377(02)00121-9_BIB8","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1287\/opre.48.2.294.12382","article-title":"Aggregation error bounds for a class of location models","volume":"48","author":"Francis","year":"2000","journal-title":"Oper. Res."},{"key":"10.1016\/S0167-6377(02)00121-9_BIB9","series-title":"Location on Networks: Theory and Algorithms","author":"Handler","year":"1979"},{"key":"10.1016\/S0167-6377(02)00121-9_BIB10","series-title":"Inequalities","author":"Hardy","year":"1952"},{"key":"10.1016\/S0167-6377(02)00121-9_BIB11","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1287\/opre.39.1.100","article-title":"Finite dominating sets for network location problems","volume":"39","author":"Hooker","year":"1991","journal-title":"Oper. Res."},{"key":"10.1016\/S0167-6377(02)00121-9_BIB12","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/S0166-218X(00)00238-9","article-title":"On bisectors for different distance functions","volume":"109","author":"Icking","year":"2001","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0167-6377(02)00121-9_BIB13","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1002\/(SICI)1097-0037(199610)28:3<167::AID-NET5>3.0.CO;2-L","article-title":"On the location of a tree-shaped facility","volume":"28","author":"Kim","year":"1996","journal-title":"Networks"},{"key":"10.1016\/S0167-6377(02)00121-9_BIB14","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/S0966-8349(98)00032-1","article-title":"The rectilinear single facility location problem with minimum distance constraints","volume":"5","author":"Konforty","year":"1998","journal-title":"Location Sci."},{"key":"10.1016\/S0167-6377(02)00121-9_BIB15","doi-asserted-by":"crossref","first-page":"852","DOI":"10.1145\/2157.322410","article-title":"Applying parallel computation algorithms in the design of serial algorithms","volume":"30","author":"Megiddo","year":"1983","journal-title":"J. Assoc. Comput. Math."},{"key":"10.1016\/S0167-6377(02)00121-9_BIB16","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1137\/0210023","article-title":"An O(nlog2n) algorithm for the kth longest path in a tree with applications to location problems","volume":"10","author":"Megiddo","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0167-6377(02)00121-9_BIB17","unstructured":"P.B. Mirchandani, R.L. Francis (Eds.), Discrete Location Theory, Wiley, New York, 1990."},{"key":"10.1016\/S0167-6377(02)00121-9_BIB18","doi-asserted-by":"crossref","unstructured":"S. Nickel, Discrete ordered Weber problems, in: Operations Research Proceedings 2000, B. Fleischmann, R. Lasch, U. Derigs, W. Dkomschke and U. Rieder (Eds.), Springer, Berlin, 2001, pp. 71\u201376.","DOI":"10.1007\/978-3-642-56656-1_12"},{"key":"10.1016\/S0167-6377(02)00121-9_BIB19","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1002\/(SICI)1097-0037(199912)34:4<283::AID-NET8>3.0.CO;2-2","article-title":"A unified approach to network location problems","volume":"34","author":"Nickel","year":"1999","journal-title":"Networks"},{"key":"10.1016\/S0167-6377(02)00121-9_BIB20","unstructured":"W. Ogryczak, A. Tamir, Minimizing the sum of the k largest functions in linear time, Technical Report, Tel Aviv University, Tel Aviv, Israel, 2001."},{"key":"10.1016\/S0167-6377(02)00121-9_BIB21","unstructured":"J. Puerto, F.R. Fern\u00e1ndez, The symmetrical single facility location problem. Technical Report, Prepublicaci\u00f3n de la Facultad de Matem\u00e1ticas, Universidad de Sevilla, 1995."},{"key":"10.1016\/S0167-6377(02)00121-9_BIB22","first-page":"321","article-title":"Geometrical properties of the symmetrical single facility location problem","volume":"1","author":"Puerto","year":"2000","journal-title":"J. Nonlinear Convex Anal."},{"key":"10.1016\/S0167-6377(02)00121-9_BIB23","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/s001860050003","article-title":"A flexible approach to location problems","volume":"51","author":"Rodr\u0131\u0301guez-Ch\u0131\u0301a","year":"2000","journal-title":"Math. Methods Oper. Res."},{"key":"10.1016\/S0167-6377(02)00121-9_BIB24","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1002\/jgt.3190020304","article-title":"Center to centroids in graphs","volume":"2","author":"Slater","year":"1978","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0167-6377(02)00121-9_BIB25","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/S0166-218X(00)00253-5","article-title":"The k-centrum multi-facility location problem","volume":"109","author":"Tamir","year":"2001","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0167-6377(02)00121-9_BIB26","doi-asserted-by":"crossref","unstructured":"T. Tokuyama, Minimax parametric optimization problems in multi-dimensional parametric searching, in: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, 2001, pp. 75\u201384.","DOI":"10.1145\/380752.380777"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637702001219?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637702001219?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T12:24:51Z","timestamp":1555158291000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637702001219"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,6]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,6]]}},"alternative-id":["S0167637702001219"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(02)00121-9","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2002,6]]}}}