{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T08:57:33Z","timestamp":1758272253118},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,10,12]],"date-time":"2017-10-12T00:00:00Z","timestamp":1507766400000},"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":["J Comb Optim"],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1007\/s10878-017-0183-4","type":"journal-article","created":{"date-parts":[[2017,10,12]],"date-time":"2017-10-12T16:00:30Z","timestamp":1507824030000},"page":"1128-1144","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["The mixed center location problem"],"prefix":"10.1007","volume":"36","author":[{"given":"Yi","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jigen","family":"Peng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yinfeng","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,10,12]]},"reference":[{"key":"183_CR1","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/PL00009387","volume":"20","author":"PK Agarwal","year":"2000","unstructured":"Agarwal PK, Sharir M, Welzl E (2000) The discrete 2-center problem. Discrete Comput Geom 20:287\u2013305","journal-title":"Discrete Comput Geom"},{"key":"183_CR2","doi-asserted-by":"crossref","DOI":"10.1142\/8685","volume-title":"Voronoi diagrams and Delaunay triangulations","author":"F Aurenhammer","year":"2013","unstructured":"Aurenhammer F, Klein R, Lee DT (2013) Voronoi diagrams and Delaunay triangulations. World Scientific Publishing Company, Singapore"},{"key":"183_CR3","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/S0925-7721(99)00019-X","volume":"13","author":"TM Chan","year":"1999","unstructured":"Chan TM (1999) More planar two-center algorithms. Comput Geom Theory Appl 13:189\u2013198","journal-title":"Comput Geom Theory Appl"},{"key":"183_CR4","doi-asserted-by":"crossref","first-page":"1646","DOI":"10.1016\/j.cor.2008.03.009","volume":"36","author":"D Chen","year":"2009","unstructured":"Chen D, Chen R (2009) New relaxation-based algorithms for the optimal solution of the continuous and discrete p-center problems. Comput Oper Res 36:1646\u20131655","journal-title":"Comput Oper Res"},{"issue":"9","key":"183_CR5","first-page":"428","volume":"45","author":"MS Daskin","year":"2000","unstructured":"Daskin MS (2000) A new approach to solving the vertex p-center problem to optimality: algorithm and computational results. Commun Oper Res Soc Jpn 45(9):428\u201336","journal-title":"Commun Oper Res Soc Jpn"},{"key":"183_CR6","first-page":"741","volume":"35","author":"Z Drezener","year":"1984","unstructured":"Drezener Z (1984) The p-center problem-heuristics and optimal algorithms. J Oper Res Soc 35:741\u2013748","journal-title":"J Oper Res Soc"},{"key":"183_CR7","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1287\/ijoc.1030.0028","volume":"16","author":"S Elloumi","year":"2004","unstructured":"Elloumi S, Labb M, Pochet Y (2004) A new formulation and resolution method for the p-center problem. IINFORMS J Comput 16:84\u201394","journal-title":"IINFORMS J Comput"},{"key":"183_CR8","unstructured":"Eppstein D (1997) Faster construction of planar two-centers. In: Proceedings of the 8th ACM-SIAM symposium on discrete algorithms, pp 131\u2013138"},{"key":"183_CR9","doi-asserted-by":"crossref","unstructured":"Feder T, Greene D (1988) Optimal algorithms for approximate clustering. In: Proceedings of the 20th ACM symposium on theory of computing, pp 434\u2013444","DOI":"10.1145\/62212.62255"},{"key":"183_CR10","unstructured":"Franti P et al (2015) Clustering datasets. http:\/\/cs.uef.fi\/sipu\/datasets\/"},{"key":"183_CR11","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","volume":"38","author":"TF Gonzalez","year":"1985","unstructured":"Gonzalez TF (1985) Clustering to minimize the maximum intercluster distance. Theor Comput Sci 38:293\u2013306","journal-title":"Theor Comput Sci"},{"key":"183_CR12","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0020-0190(93)90153-Z","volume":"47","author":"J Hershberger","year":"1993","unstructured":"Hershberger J (1993) A faster algorithm for the two-center decision problem. Inf Process Lett 47:23\u201329","journal-title":"Inf Process Lett"},{"key":"183_CR13","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1016\/0196-6774(91)90013-O","volume":"12","author":"J Hershberger","year":"1991","unstructured":"Hershberger J, Suri S (1991) Finding tailored partitions. J Algorithms 12:431\u2013463","journal-title":"J Algorithms"},{"issue":"2","key":"183_CR14","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1287\/moor.10.2.180","volume":"10","author":"DS Hochbaum","year":"1985","unstructured":"Hochbaum DS, Shmoys DB (1985) A best possible heuristic for the k-center problem. Math Oper Res 10(2):180\u2013184","journal-title":"Math Oper Res"},{"key":"183_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01185335","volume":"9","author":"RZ Hwang","year":"1993","unstructured":"Hwang RZ, Lee RCT, Chang RC (1993) The slab dividing approach to solve the Euclidean P-center problem. Algorithmica 9:1\u201322","journal-title":"Algorithmica"},{"key":"183_CR16","unstructured":"Ilhan T, Ozsoy FA, Pinar MC (2002) An efficient exact algorithm for the vertex p-center problem and computational experiments for different set covering subproblems. http:\/\/www.optimization-online.org\/DB_HTML\/2002\/12\/588.html"},{"key":"183_CR17","doi-asserted-by":"crossref","unstructured":"Jaromczyk J, Kowaluk M (1994) An efficient algorithm for the Euclidean two-center problem. In: Proceedings 10th ACM symposium on computational geometry, pp 303\u2013311","DOI":"10.1145\/177424.178038"},{"key":"183_CR18","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1137\/0137040","volume":"37","author":"O Kariv","year":"1979","unstructured":"Kariv O, Hakimi SL (1979) An algorithmic approach to network location problems, Part I. The p-centers. SIAM J Appl Math 37:513\u2013538","journal-title":"SIAM J Appl Math"},{"key":"183_CR19","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1137\/0212052","volume":"12","author":"N Megiddo","year":"1983","unstructured":"Megiddo N (1983) Linear-time algorithms for the linear programming in $$R^3$$ R 3 and related problems. SIAM J Comput 12:759\u2013776","journal-title":"SIAM J Comput"},{"key":"183_CR20","doi-asserted-by":"crossref","first-page":"1182","DOI":"10.1137\/0213014","volume":"13","author":"N Megiddo","year":"1984","unstructured":"Megiddo N, Supowit K (1984) On the complexity of some common geometric location problems. SIAM J Comput 13:1182\u20131196","journal-title":"SIAM J Comput"},{"key":"183_CR21","unstructured":"Nagarajan V, Schieber B, Shachnai H (2013) The Eucildean k-supplier problem. In: Goemans M, Correa J (eds) IPCO 2013. LNCS, vol 7801. Springer, Heidelberg, pp 290\u2013301"},{"key":"183_CR22","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1002\/net.10081","volume":"42","author":"M Nenad","year":"2003","unstructured":"Nenad M, Martine L, Pierre H (2003) Solving the p-center problem with tabu search and variable neighborhood search. Networks 42:48\u201364","journal-title":"Networks"},{"key":"183_CR23","doi-asserted-by":"crossref","unstructured":"Shamos M, Michael I, Hoey D (1975) Closest-point problems. In: 16th annual symposium on IEEE foundations of computer science, pp 151\u2013162","DOI":"10.1109\/SFCS.1975.8"},{"key":"183_CR24","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/PL00009311","volume":"18","author":"M Sharir","year":"1997","unstructured":"Sharir M (1997) A near-linear algorithm for the planar 2-center problem. Discrete Comput Geom 18:125\u2013134","journal-title":"Discrete Comput Geom"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-017-0183-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0183-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0183-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,4]],"date-time":"2019-10-04T15:15:49Z","timestamp":1570202149000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-017-0183-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,12]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["183"],"URL":"https:\/\/doi.org\/10.1007\/s10878-017-0183-4","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,10,12]]}}}