Voir la notice de l'article provenant de la source Math-Net.Ru
@article{DA_2007_14_3_a0,
author = {A. A. Ageev},
title = {{\CYRM}{\cyre}{\cyrt}{\cyrr}{\cyri}{\cyrch}{\cyre}{\cyrs}{\cyrk}{\cyri}{\cyre} {\cyrz}{\cyra}{\cyrd}{\cyra}{\cyrch}{\cyri} {\cyrr}{\cyra}{\cyrz}{\cyrm}{\cyre}{\cyrshch}{\cyre}{\cyrn}{\cyri}{\cyrya} c~{\cyrn}{\cyre}~{\cyrk}{\cyrr}{\cyra}{\cyrt}{\cyrch}{\cyra}{\cyrishrt}{\cyrsh}{\cyri}{\cyrm}{\cyri} {\cyrm}{\cyra}{\cyrr}{\cyrsh}{\cyrr}{\cyru}{\cyrt}{\cyra}{\cyrm}{\cyri} {\cyro}{\cyrb}{\cyrs}{\cyrl}{\cyru}{\cyrzh}{\cyri}{\cyrv}{\cyra}{\cyrn}{\cyri}{\cyrya}},
journal = {Diskretnyj analiz i issledovanie operacij},
pages = {3--12},
publisher = {mathdoc},
volume = {14},
number = {3},
year = {2007},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/DA_2007_14_3_a0/}
}
A. A. Ageev. Метрические задачи размещения c~не~кратчайшими маршрутами обслуживания. Diskretnyj analiz i issledovanie operacij, Tome 14 (2007) no. 3, pp. 3-12. http://geodesic.mathdoc.fr/item/DA_2007_14_3_a0/
[1] Gimadi E. Kh., “Effektivnyi algoritm resheniya zadachi razmescheniya s oblastyami obsluzhivaniya, svyaznymi otnositelno atsiklicheskoi seti”, Ekstremalnye zadachi issledovaniya operatsii (Upravlyaemye sistemy), Sb. nauchn. rabot, 23, Institut matematiki SO AN SSSR, Novosibirsk, 1983, 12–23 | MR
[2] Ageev A. A., “A criterion of polynomial time solvability for the network location problem”, Integer programming and combinatorial optimization, Campus Printing, Carnegie Mellon University, 1992, 237–245
[3] Arya V., Garg N., Khandekar R., Meyerson A., Munagala K., Pandit V., “Local search heuristics for $k$-median and facility location problems”, SIAM J. Comput., 33:3 (2004), 544–562 | DOI | MR | Zbl
[4] Bhatia R., Guha S., Khuller S., Sussmann Y. J., “Facility location with dynamic distance function”, J. Combinatorial Optimization, 2:3 (1998), 199–217 | DOI | MR | Zbl
[5] Charikar M., Khuller S., Mount D. M., Narasimhan G., “Algorithms for facility location problems with outliers”, Proc. of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms (Washington, DC, 2001), ACM Press, New York, 2001, 642–651 | MR | Zbl
[6] Cornuéjols G., Nemhauser G. L., Wolsey L. A., “The uncapacitated facility location problem”, Discrete Location Theory, Wiley, New York, 1990, 119–171 | MR
[7] Guha S., Meyerson A., Munagala K., “A constant factor approximation algorithm for the fault-tolerant facility location problem”, J. Algorithms, 48:2 (2003), 429–440 | DOI | MR | Zbl
[8] Jain K., Mahdian M., Saberi A., “A new greedy approach for facility location problems”, Proc. of the 34th Annual ACM Symposium on Theory of Computing, ACM Press, New York, 2002, 731–740 | MR
[9] Khuller S., Pless R., Sussmann Y. J., “Fault tolerant $K$-center problems”, Theoret. Comput. Sci., 242:1–2 (2000), 237–245 | DOI | MR | Zbl
[10] Mahdian M., Ye Y., Zhang J., “Approximation algorithms for metric facility location problems”, SIAM J. Comput., 36:2 (2006), 411–432 | DOI | MR | Zbl
[11] Tamir A., Halman N., “One-way and round-trip center location problems”, Discrete Optim., 2:2 (2005), 168–184 | DOI | MR | Zbl
[12] Zhang J., Chen B., Ye Y., “A multiexchange local search algorithm for the capacitated facility location problem”, Math. Oper. Res., 30:2 (2005), 389–403 | DOI | MR | Zbl