Geodesic
Метод декомпозиции для задачи о $p$-медиане на несвязном графе
Diskretnyj analiz i issledovanie operacij, Tome 14 (2007) no. 1, pp. 43-58.

Voir la notice de l'article provenant de la source Math-Net.Ru

@article{DA_2007_14_1_a2,
     author = {I. L. Vasiliev},
     title = {{\CYRM}{\cyre}{\cyrt}{\cyro}{\cyrd} {\cyrd}{\cyre}{\cyrk}{\cyro}{\cyrm}{\cyrp}{\cyro}{\cyrz}{\cyri}{\cyrc}{\cyri}{\cyri} {\cyrd}{\cyrl}{\cyrya} {\cyrz}{\cyra}{\cyrd}{\cyra}{\cyrch}{\cyri} {\cyro} $p$-{\cyrm}{\cyre}{\cyrd}{\cyri}{\cyra}{\cyrn}{\cyre} {\cyrn}{\cyra} {\cyrn}{\cyre}{\cyrs}{\cyrv}{\cyrya}{\cyrz}{\cyrn}{\cyro}{\cyrm} {\cyrg}{\cyrr}{\cyra}{\cyrf}{\cyre}},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {43--58},
     publisher = {mathdoc},
     volume = {14},
     number = {1},
     year = {2007},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2007_14_1_a2/}
}
TY  - JOUR
AU  - I. L. Vasiliev
TI  - Метод декомпозиции для задачи о $p$-медиане на несвязном графе
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2007
SP  - 43
EP  - 58
VL  - 14
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2007_14_1_a2/
LA  - ru
ID  - DA_2007_14_1_a2
ER  - 
%0 Journal Article
%A I. L. Vasiliev
%T Метод декомпозиции для задачи о $p$-медиане на несвязном графе
%J Diskretnyj analiz i issledovanie operacij
%D 2007
%P 43-58
%V 14
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2007_14_1_a2/
%G ru
%F DA_2007_14_1_a2
I. L. Vasiliev. Метод декомпозиции для задачи о $p$-медиане на несвязном графе. Diskretnyj analiz i issledovanie operacij, Tome 14 (2007) no. 1, pp. 43-58. http://geodesic.mathdoc.fr/item/DA_2007_14_1_a2/

[1] Tanaev V. S., Shkurba V. V., Vvedenie v teoriyu raspisanii, Nauka, M., 1975 | MR | Zbl

[2] Argonne National Laboratory. Installation and User's Guide to MPICH, University of Chicago, Chicago, 2003

[3] Avella P., Boccia M., Di Martino C., Oliviero G., Sforza A., Vasil'ev I., “A decomposition approach for a very large scale optimal diversity management problem”, 4OR, 3:1 (2003), 23–37 | DOI | MR

[4] “Computational study of large-scale $p$-median problems”, Mathematical Programming, 109:Avella P., Sassano A., Vasil'ev I. (2007), 89–114 | DOI | MR | Zbl

[5] Avella P., Sforza A., “Logical reduction tests for the $p$-median problem”, Ann. Oper. Res., 86 (1999), 105–115 | DOI | MR | Zbl

[6] Beasley J. E., “Lagrangean heuristics for location problems”, European J. Oper. Res., 65:3 (1993), 383–399 | DOI | Zbl

[7] Briant O., Naddef D., “The optimal diversity management problem”, Oper. Res., 52:4 (2004), 515–526 | DOI | MR

[8] Cornuejols G., Fisher M. L., Nemhauser G. L., “Location of bank accounts to optimize float : An analytic study of exact and approximate algorithms”, Management Science, 23 (1977), 789–810 | DOI | MR | Zbl

[9] Hansen P., Mladenovic N., Perez-Brito D., “Variable neighbourhood decomposition search”, J. Heuristics, 7:4 (2001), 335–350 | DOI | Zbl

[10] Kariv O., Hakimi L., “An algorithmic approach to network location problems. II: The $p$-medians”, SIAM J. Appl. Math., 37 (1979), 539–560 | DOI | MR | Zbl

[11] Martello S., Toth P., Knapsack problems. Algorithms and computer implementations, John Wiley Sons, Ltd., Chichester, 1990 | MR | Zbl

[12] Mladenovic N., Brimberg J., Hansen P., Moreno-Perez J. A., “The $p$-median problem: a survey of metaheuristic approaches”, European J. Oper. Res., 179:3 (2007), 927–939 | DOI | MR | Zbl

[13] Resende M. G. C., Werneck R. F., A grasp with path-relinking for the $p$-median problem, Technical Report TD-5E53XL, AT Labs, 2002

[14] Resende M. G. C., Werneck R. F., On the implementation of a swapbased local search procedure for the $p$-median problem, Technical Report TD-5E4QKA, AT Labs, 2002

[15] Whitaker R. A., “A fast algorithm for the greedy interchange for large-scale clustering and median location problems”, INFOR. Can. J. Oper. Res. Inf. Process, 21 (1983), 95–108 | Zbl