Abstract
This paper deals with downgrading the 1-median, i.e., changing values of parameters within certain bounds such that the optimal objective value of the location problem with respect to the new values is maximized. We suggest a game-theoretic view at this problem which leads to a characterization of an optimal solution. This approach is demonstrated by means of the Downgrading 1-median problem in the plane with Manhattan metric and implies an \(\mathcal {O}(n\log^{2}n)\) time algorithm for this problem.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Balas, E., & Zemel, E. (1980). An algorithm for large zero-one knapsack problems. Operations Research, 28(5), 1130–1154.
Burkard, R. E., Klinz, B., & Zhang, J. (2001). Bottleneck capacity expansion problems with general budget constraints. RAIRO Operations Research, 35(1), 1–20.
Burkard, R. E., Lin, Y., & Zhang, J. (2004). Weight reduction problems with certain bottleneck objectives. European Journal of Operational Research, 153(1), 191–199.
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–121.
Frederickson, G. N., & Solis-Oba, R. (1999). Increasing the weight of minimum spanning trees. Journal of Algorithms, 33(2), 244–266.
Fulkerson, D. R., & Harding, G. C. (1977). Maximizing the minimum source-sink path subject to a budget constraint. Mathematical Programming, 13(1), 116–118.
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.
Gassner, E. (2009). Up- and downgrading the 1-center in a network. European Journal of Operational Research, 198, 370–377. http://dx.doi.org/10.1016/j.ejor.2008.09.013.
Goldman, A. J. (1971). Optimal center location in simple networks. Transportation Science, 5, 212–221.
Hamacher, H. W. (1995). Mathematische Lösungsverfahren für planare Standortprobleme. Braunschweig: Vieweg.
Hambrusch, S. E. Tu, H.-Y. (1997). Edge weight reduction problems in directed acyclic graphs. Journal of Algorithms, 24(1), 66–93.
Juel, H., & Love, R. F. (1983). Hull properties in location problems. European Journal of Operational Research, 12(3), 262–265.
Kakutani, S. (1941). A generalization of Brouwer’s fixed point theorem. Duke Mathematical Journal, 8, 457–459.
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–288.
Larson, R. C., Li, V.O.K. (1981). Finding minimum rectilinear distance paths in the presence of barriers. Networks, 11(3), 285–304.
Megiddo, N., & Tamir, A. (1993). Linear time algorithms for some separable quadratic programming problems. Operations Research Letters, 13(4), 203–211.
Phillips, C. A. (1993). The network inhibition problem. In Proceedings 25th annual ACM symposium on theory of computing (pp. 776–785).
Tyrell Rockafellar, R. (1970). Convex analysis. Princeton mathematical series, Vol. 28. Princeton: Princeton University Press.
Author information
Authors and Affiliations
Corresponding author
Additional information
This research has been supported by the Austrian Science Fund (FWF) Project P18918-N18.
Rights and permissions
About this article
Cite this article
Gassner, E. A game-theoretic approach for downgrading the 1-median in the plane with Manhattan metric. Ann Oper Res 172, 393–404 (2009). https://doi.org/10.1007/s10479-009-0641-1
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-009-0641-1