Abstract
The inverse 1-median problem is concerned with modifying the weights of the customers at minimum cost such that a prespecified supplier becomes the 1-median of modified location problem. We first present the model of inverse 1-median problem on trees. Then we propose two algorithms to solve the problem under weighted l ∞ norm with bound constraints on modifications. Based on the approach of the unbounded case, we devise a greedy-type algorithm which runs in O(n 2) time, where n is the number of vertices. Based on the property of the optimal solution, we propose an O(n logn) time algorithm using the binary search.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Alizadeh, B., Burkard, R.E.: Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees. Technical Report, Graz University of Technology (2009), http://www.math.tugraz.at/fosp/pdfs/tugraz_0143.pdf
Alizadeh, B., Burkard, R.E., Pferschy, U.: Inverse 1-center location problems with edge length augmentation on trees. Computing 86(4), 331–343 (2009)
Balas, E., Zemel, E.: An algorithm for large zero-one knapsack problems. Operations Research 28, 1130–1154 (1980)
Bonab, F.B., Burkard, R.E., Alizadeh, B.: Inverse Median Location Problems with Variable Coordinates. Central European Journal of Operations Research (2009), doi:10.1007/s10100-009-0114-2
Burkard, R.E., Galavii, M., Gassner, E.: The inverse Fermat-Weber problem. Technical Report, Graz University of Technology (2008), http://www.math.tugraz.at/fosp/pdfs/tugraz_0107.pdf
Burkard, R.E., Pleschiutschnig, C., Zhang, J.: Inverse median problems. Discrete Optimization 1, 23–39 (2004)
Burkard, R.E., Pleschiutschnig, C., Zhang, J.Z.: The inverse 1- median problem on a cycle. Discrete Optimization 5, 242–253 (2008)
Cai, M., Yang, X., Zhang, J.: The complexity analysis of the inverse center location problem. J. Global Optim. 5, 213–218 (1999)
Galavii, M.: Inverse 1-Median Problems, Ph.D. Thesis, Institute of Optimization and Discrete Mathematics, Graz University of Technology, Graz, Austria (2008)
Gassner, E.: The inverse 1-maxian problem with edge length modiffication. Journal of Combinatorial Optimization 16, 50–67 (2008)
Gassner, E.: A game-theoretic approach for downgrading the 1-median in the plane with manhattan metric. Ann. Oper. Res. 172(1), 393–404 (2009)
Goldman, A.J.: Optimal center location in simple networks. Transportation Science 2, 77–91 (1962)
Hua, et al.: Applications of mathematical models to wheat harvesting. Acta Mathematica Sinica 11, 63–75 (1961) (in Chinese); English Translation in Chinese Math. 2, 77–91 (1962)
Yang, X., Zhang, J.: Inverse center location problem on a tree. Journal of Systems Science and Complexity 21, 651–664 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Guan, X., Zhang, B. (2010). Inverse 1-median Problem on Trees under Weighted l ∞ Norm. In: Chen, B. (eds) Algorithmic Aspects in Information and Management. AAIM 2010. Lecture Notes in Computer Science, vol 6124. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14355-7_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-14355-7_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14354-0
Online ISBN: 978-3-642-14355-7
eBook Packages: Computer ScienceComputer Science (R0)