On the complexity of local search in the $p$-median problem
Diskretnyj analiz i issledovanie operacij, Tome 12 (2005) no. 2, pp. 44-71

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

@article{DA_2005_12_2_a2,
     author = {Yu. A. Kochetov and M. G. Pashchenko and A. V. Plyasunov},
     title = {On the complexity of local search in the $p$-median problem},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {44--71},
     publisher = {mathdoc},
     volume = {12},
     number = {2},
     year = {2005},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2005_12_2_a2/}
}
TY  - JOUR
AU  - Yu. A. Kochetov
AU  - M. G. Pashchenko
AU  - A. V. Plyasunov
TI  - On the complexity of local search in the $p$-median problem
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2005
SP  - 44
EP  - 71
VL  - 12
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2005_12_2_a2/
LA  - ru
ID  - DA_2005_12_2_a2
ER  - 
%0 Journal Article
%A Yu. A. Kochetov
%A M. G. Pashchenko
%A A. V. Plyasunov
%T On the complexity of local search in the $p$-median problem
%J Diskretnyj analiz i issledovanie operacij
%D 2005
%P 44-71
%V 12
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2005_12_2_a2/
%G ru
%F DA_2005_12_2_a2
Yu. A. Kochetov; M. G. Pashchenko; A. V. Plyasunov. On the complexity of local search in the $p$-median problem. Diskretnyj analiz i issledovanie operacij, Tome 12 (2005) no. 2, pp. 44-71. http://geodesic.mathdoc.fr/item/DA_2005_12_2_a2/