Geodesic
Exact and Heuristic Algorithms for Solving Discrete Weber Problem for~a~Simple Cycle
Sibirskij žurnal čistoj i prikladnoj matematiki, Tome 14 (2014) no. 2, pp. 98-107

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

Here is set the exact and heuristic algorithms, which solves discrete Veber problem for simple cycle and finite set of location position. On a problem class, which was generated in a random way, the comparison of action period of a given algorithm and a model of integer linear programming, which was realized in IBM ILOG CPLEX, is carried out.
Keywords: location problem, Weber problem, simple cycle, exact algorithm, dynamic programming.
Mots-clés : heuristic algorithm 
@article{VNGU_2014_14_2_a9,
     author = {R. E. Shangin},
     title = {Exact and {Heuristic} {Algorithms} for {Solving} {Discrete} {Weber} {Problem} {for~a~Simple} {Cycle}},
     journal = {Sibirskij \v{z}urnal \v{c}istoj i prikladnoj matematiki},
     pages = {98--107},
     publisher = {mathdoc},
     volume = {14},
     number = {2},
     year = {2014},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VNGU_2014_14_2_a9/}
}
TY  - JOUR
AU  - R. E. Shangin
TI  - Exact and Heuristic Algorithms for Solving Discrete Weber Problem for~a~Simple Cycle
JO  - Sibirskij žurnal čistoj i prikladnoj matematiki
PY  - 2014
SP  - 98
EP  - 107
VL  - 14
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/VNGU_2014_14_2_a9/
LA  - ru
ID  - VNGU_2014_14_2_a9
ER  - 
%0 Journal Article
%A R. E. Shangin
%T Exact and Heuristic Algorithms for Solving Discrete Weber Problem for~a~Simple Cycle
%J Sibirskij žurnal čistoj i prikladnoj matematiki
%D 2014
%P 98-107
%V 14
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/VNGU_2014_14_2_a9/
%G ru
%F VNGU_2014_14_2_a9
R. E. Shangin. Exact and Heuristic Algorithms for Solving Discrete Weber Problem for~a~Simple Cycle. Sibirskij žurnal čistoj i prikladnoj matematiki, Tome 14 (2014) no. 2, pp. 98-107. http://geodesic.mathdoc.fr/item/VNGU_2014_14_2_a9/