Abstract
We study the generalizations of the classical metric location problems in which the route of a service team passes through a remote depository containing some components needed for replacement. Generally speaking, in this case the path to the client is not shortest and the problem ceases to be metric. We show that the available approximation algorithms for the classical metric problems translate to our generalizations with preservation of approximation ratios.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
E. Kh. Gimadi, “An Effective Algorithm for Solving the Location Problem with Service Regions Connected with Respect an Acyclic Network,” Upravlyaemye Sistemy 23, 12–23 (1983).
A. A. Ageev, “A Criterion of Polynomial Time Solvability for the Network Location Problem,” in Integer Programming and Combinatorial Optimization (Campus Printing, Carnegie Mellon Univ., 1992), pp. 237–245.
V. Arya, N. Garg, R. Khandekar, A. Meyerson, K. Munagala, and V. Pandit, “Local Search Heuristics for k-Median and Facility Location Problems,” SIAM J. Comput. 33(3), 544–562 (2004).
R. Bhatia, S. Guha, S. Khuller, and Y. J. Sussmann, “Facility Location with Dynamic Distance Function,” J. Combin. Optim. 2(3), 199–217 (1998).
M. Charikar, S. Khuller, D. M. Mount, and G. Narasimhan, “Algorithms for Facility Location Problems with Outliers,” in Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms (Washington, DC, 2001) (ACM Press, New York, 2001), pp. 642–651.
SG. Cornuéjols, G. L. Nemhauser, and L. A. Wolsey, “The Uncapacitated Facility Location Problem,” in Discrete Location Theory (Wiley, New York, 1990), pp. 119–171.
S. Guha, A. Meyerson, and K. Munagala, “A Constant Factor Approximation Algorithm for the Fault-Tolerant Facility Location Problem,” J. Algorithms 48(2), 429–440 (2003).
K. Jain, M. Mahdian, and A. Saberi, “A New Greedy Approach for Facility Location Problems,” in Proceedings of the 34th Annual ACM Symposium on Theory of Computing (ACM Press, New York, 2002), pp. 731–740.
S. Khuller, R. Pless, Y. J. Sussmann, “Fault Tolerant K-Center Problems,” Theoret. Comput. Sci. 242(1–2), 237–245 (2000).
M. Mahdian, Y. Ye, and J. Zhang, “Approximation Algorithms for Metric Facility Location Problems,” SIAM J. Comput. 36(2), 411–432 (2006).
A. Tamir and N. Halman, “One-Way and Round-Trip Center Location Problems,” Discrete Optim. 2(2), 168–184 (2005).
J. Zhang, B. Chen, and Y. Ye, “A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem,” Math. Oper. Res. 30(2), 389–403 (2005).
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © A.A. Ageev, 2007, published in Diskretnyi Analiz i Issledovanie Operatsii, Ser. 1, 2007, Vol. 14, No. 3, pp. 3–12.
Rights and permissions
About this article
Cite this article
Ageev, A.A. Metric location problems with nonshortest service routes. J. Appl. Ind. Math. 2, 311–316 (2008). https://doi.org/10.1134/S1990478908030022
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1990478908030022