Abstract
Given n points in \({\mathbb{R}^d}\) with nonnegative weights, the inverse 1-median problem with variable coordinates consists in changing the coordinates of the given points at minimum cost such that a prespecified point in \({\mathbb{R}^d}\) becomes the 1-median. The cost is proportional to the increase or decrease of the corresponding point coordinate. If the distances between points are measured by the rectilinear norm, the inverse 1-median problem is \({\mathcal{NP}}\)-hard, but it can be solved in pseudo-polynomial time. Moreover, a fully polynomial time approximation scheme exists in this case. If the point weights are assumed to be equal, the corresponding inverse problem can be reduced to d continuous knapsack problems and is therefore solvable in O(nd) time. In case that the squared Euclidean norm is used, we derive another efficient combinatorial algorithm which solves the problem in O(nd) time. It is also shown that the inverse 1-median problem endowed with the Chebyshev norm in the plane is \({\mathcal{NP}}\)-hard. Another pseudo-polynomial algorithm is developed for this case, but it is shown that no fully polynomial time approximation scheme does exist.
Similar content being viewed by others
References
Alizadeh B, Burkard RE (2009) Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees. Technical Report 2009-09, Graz University of Technology
Alizadeh B, Burkard RE, Pferschy U (2009) Inverse 1-center location problems with edge length augmentation on trees. To appear in Computing
Balas E, Zemel E (1980) An algorithm for large zero-one knapsack problem. Oper Res 28: 1130–1154
Baroughi Bonab F, Burkard RE, Gassner E (2009) Inverse p-median problems with variable edge lengths. Technical Report 2009-13, Graz University of Technology
Burkard RE, Pleschiutschnig C, Zhang J (2004) Inverse median problems. Discret Optim 1: 23–39
Burkard RE, Galavii M, Gassner E (2008a) The inverse Fermat–Weber problem. Technical Report 2008-14, Graz University of Technology
Burkard RE, Pleschiutschnig C, Zhang JZ (2008b) The inverse 1- median problem on a cycle. Discret Optim 5: 242–253
Cai MC, Yang XG, Zhang JZ (1999) The complexity analysis of the inverse center location problem. J Glob Optim 15: 213–218
Gassner E (2008) The inverse 1-maxian problem with edge length modification. J Comb Optim 16: 50–67
Hamacher HW (1995) Mathematische Lösungsverfahren für planare Standortprobleme. Vieweg, Braunschweig
Kellerer H, Pferschy U, Pisinger D (2004) Knapsack problems. Springer, Berlin
Martello S, Toth P (1990) Knapsack problems: algorithms and computer implementations. Wiley, Chichester
Pruhs K, Woeginger GJ (2007) Approximation schemes for a class of subset selection problems. Theor Comput Sci 382: 151–156
Yang X, Zhang J (2008) Inverse center location problem on a tree. J Syst Sci Complex 21: 651–664
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Baroughi Bonab, F., Burkard, R.E. & Alizadeh, B. Inverse median location problems with variable coordinates. Cent Eur J Oper Res 18, 365–381 (2010). https://doi.org/10.1007/s10100-009-0114-2
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10100-009-0114-2