Geodesic
An exact algorithm for solving the discrete Weber problem for a~$k$-tree
Diskretnyj analiz i issledovanie operacij, Tome 21 (2014) no. 3, pp. 64-75

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

We consider the discrete Weber problem. A consistent deterministic algorithm for finding an exact solution to the problem for a $k$-tree and a finite set of placement positions is suggested. The algorithm is based on the idea of dynamic programming with a decomposition tree. A numerical experiment was performed to examine the effectiveness of the proposed algorithm in comparison with IBM ILOG CPLEX. Ill. 2, bibliogr. 23.
Keywords: Weber problem, $k$-tree, dynamic programming, decomposition tree, exact algorithm. 
@article{DA_2014_21_3_a6,
     author = {A. V. Panyukov and R. E. Shangin},
     title = {An exact algorithm for solving the discrete {Weber} problem for a~$k$-tree},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {64--75},
     publisher = {mathdoc},
     volume = {21},
     number = {3},
     year = {2014},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2014_21_3_a6/}
}
TY  - JOUR
AU  - A. V. Panyukov
AU  - R. E. Shangin
TI  - An exact algorithm for solving the discrete Weber problem for a~$k$-tree
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2014
SP  - 64
EP  - 75
VL  - 21
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2014_21_3_a6/
LA  - ru
ID  - DA_2014_21_3_a6
ER  - 
%0 Journal Article
%A A. V. Panyukov
%A R. E. Shangin
%T An exact algorithm for solving the discrete Weber problem for a~$k$-tree
%J Diskretnyj analiz i issledovanie operacij
%D 2014
%P 64-75
%V 21
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2014_21_3_a6/
%G ru
%F DA_2014_21_3_a6
A. V. Panyukov; R. E. Shangin. An exact algorithm for solving the discrete Weber problem for a~$k$-tree. Diskretnyj analiz i issledovanie operacij, Tome 21 (2014) no. 3, pp. 64-75. http://geodesic.mathdoc.fr/item/DA_2014_21_3_a6/