{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T23:04:45Z","timestamp":1762297485957,"version":"3.37.3"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,10,21]],"date-time":"2009-10-21T00:00:00Z","timestamp":1256083200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2009,11]]},"DOI":"10.1007\/s10479-009-0641-1","type":"journal-article","created":{"date-parts":[[2009,10,19]],"date-time":"2009-10-19T18:15:30Z","timestamp":1255976130000},"page":"393-404","source":"Crossref","is-referenced-by-count":7,"title":["A game-theoretic approach for downgrading the\u00a01-median in the\u00a0plane with Manhattan metric"],"prefix":"10.1007","volume":"172","author":[{"given":"Elisabeth","family":"Gassner","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,10,21]]},"reference":[{"issue":"5","key":"641_CR1","doi-asserted-by":"crossref","first-page":"1130","DOI":"10.1287\/opre.28.5.1130","volume":"28","author":"E. Balas","year":"1980","unstructured":"Balas, E., & Zemel, E. (1980). An algorithm for large zero-one knapsack problems. Operations Research, 28(5), 1130\u20131154.","journal-title":"Operations Research"},{"issue":"1","key":"641_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1051\/ro:2001100","volume":"35","author":"R. E. Burkard","year":"2001","unstructured":"Burkard, R. E., Klinz, B., & Zhang, J. (2001). Bottleneck capacity expansion problems with general budget constraints. RAIRO Operations Research, 35(1), 1\u201320.","journal-title":"RAIRO Operations Research"},{"issue":"1","key":"641_CR3","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/S0377-2217(02)00713-0","volume":"153","author":"R. E. Burkard","year":"2004","unstructured":"Burkard, R. E., Lin, Y., & Zhang, J. (2004). Weight reduction problems with certain bottleneck objectives. European Journal of Operational Research, 153(1), 191\u2013199.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"641_CR4","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/S0304-3975(97)00290-9","volume":"203","author":"K. U. Drangmeister","year":"1998","unstructured":"Drangmeister, K. U., Krumke, S. O., Marathe, M. V., Noltemeier, H., & Ravi, S. S. (1998). Modifying edges of a network to obtain short subgraphs. Theoretical Computer Science, 203(1), 91\u2013121.","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"641_CR5","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1006\/jagm.1999.1026","volume":"33","author":"G. N. Frederickson","year":"1999","unstructured":"Frederickson, G. N., & Solis-Oba, R. (1999). Increasing the weight of minimum spanning trees. Journal of Algorithms, 33(2), 244\u2013266.","journal-title":"Journal of Algorithms"},{"issue":"1","key":"641_CR6","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1007\/BF01584329","volume":"13","author":"D. R. Fulkerson","year":"1977","unstructured":"Fulkerson, D. R., & Harding, G. C. (1977). Maximizing the minimum source-sink path subject to a budget constraint. Mathematical Programming, 13(1), 116\u2013118.","journal-title":"Mathematical Programming"},{"key":"641_CR7","unstructured":"Gassner, E. (2007). Up- and downgrading the 1-median in a network (Technical Report 2007-16). Graz University of Technology. http:\/\/www.math.tugraz.at\/fosp\/pdfs\/tugraz_0037.pdf . Accepted for publication in Networks."},{"key":"641_CR8","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1016\/j.ejor.2008.09.013","volume":"198","author":"E. Gassner","year":"2009","unstructured":"Gassner, E. (2009). Up- and downgrading the 1-center in a network. European Journal of Operational Research, 198, 370\u2013377. http:\/\/dx.doi.org\/10.1016\/j.ejor.2008.09.013 .","journal-title":"European Journal of Operational Research"},{"key":"641_CR9","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1287\/trsc.5.2.212","volume":"5","author":"A. J. Goldman","year":"1971","unstructured":"Goldman, A. J. (1971). Optimal center location in simple networks. Transportation Science, 5, 212\u2013221.","journal-title":"Transportation Science"},{"key":"641_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-663-01968-8","volume-title":"Mathematische L\u00f6sungsverfahren f\u00fcr planare Standortprobleme","author":"H. W. Hamacher","year":"1995","unstructured":"Hamacher, H. W. (1995). Mathematische L\u00f6sungsverfahren f\u00fcr planare Standortprobleme. Braunschweig: Vieweg."},{"issue":"1","key":"641_CR11","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1006\/jagm.1997.0856","volume":"24","author":"S. E. Hambrusch","year":"1997","unstructured":"Hambrusch, S. E. Tu, H.-Y. (1997). Edge weight reduction problems in directed acyclic graphs. Journal of Algorithms, 24(1), 66\u201393.","journal-title":"Journal of Algorithms"},{"issue":"3","key":"641_CR12","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1016\/0377-2217(83)90196-0","volume":"12","author":"H. Juel","year":"1983","unstructured":"Juel, H., & Love, R. F. (1983). Hull properties in location problems. European Journal of Operational Research, 12(3), 262\u2013265.","journal-title":"European Journal of Operational Research"},{"key":"641_CR13","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1215\/S0012-7094-41-00838-4","volume":"8","author":"S. Kakutani","year":"1941","unstructured":"Kakutani, S. (1941). A generalization of Brouwer\u2019s fixed point theorem. Duke Mathematical Journal, 8, 457\u2013459.","journal-title":"Duke Mathematical Journal"},{"issue":"3","key":"641_CR14","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1023\/A:1009798010579","volume":"2","author":"S. O. Krumke","year":"1998","unstructured":"Krumke, S. O., Marathe, M. V., Noltemeier, H., Ravi, R., & Ravi, S. S. (1998). Approximation algorithms for certain network improvement problems. Journal of Combinatorial Optimization 2(3), 257\u2013288.","journal-title":"Journal of Combinatorial Optimization"},{"issue":"3","key":"641_CR15","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1002\/net.3230110307","volume":"11","author":"R. C. Larson","year":"1981","unstructured":"Larson, R. C., Li, V.O.K. (1981). Finding minimum rectilinear distance paths in the presence of barriers. Networks, 11(3), 285\u2013304.","journal-title":"Networks"},{"issue":"4","key":"641_CR16","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0167-6377(93)90041-E","volume":"13","author":"N. Megiddo","year":"1993","unstructured":"Megiddo, N., & Tamir, A. (1993). Linear time algorithms for some separable quadratic programming problems. Operations Research Letters, 13(4), 203\u2013211.","journal-title":"Operations Research Letters"},{"key":"641_CR17","doi-asserted-by":"crossref","unstructured":"Phillips, C. A. (1993). The network inhibition problem. In Proceedings 25th annual ACM symposium on theory of computing (pp.\u00a0776\u2013785).","DOI":"10.1145\/167088.167286"},{"key":"641_CR18","series-title":"Princeton mathematical series","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex analysis","author":"R. Tyrell Rockafellar","year":"1970","unstructured":"Tyrell Rockafellar, R. (1970). Convex analysis. Princeton mathematical series, Vol.\u00a028. Princeton: Princeton University Press."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-009-0641-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-009-0641-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-009-0641-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:07:57Z","timestamp":1559138877000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-009-0641-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,10,21]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,11]]}},"alternative-id":["641"],"URL":"https:\/\/doi.org\/10.1007\/s10479-009-0641-1","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2009,10,21]]}}}