|
|
Vestnik Novosibirskogo Gosudarstvennogo Universiteta. Seriya Matematika, Mekhanika, Informatika, 2014, Volume 14, Issue 2, Pages 98–107
(Mi vngu340)
|
|
|
|
Exact and Heuristic Algorithms for Solving Discrete Weber Problem for a Simple Cycle
R. E. Shangin South Ural State University, Chelyabinsk
Abstract:
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, heuristic algorithm, dynamic programming.
Received: 04.02.2013
Citation:
R. E. Shangin, “Exact and Heuristic Algorithms for Solving Discrete Weber Problem for a Simple Cycle”, Vestn. Novosib. Gos. Univ., Ser. Mat. Mekh. Inform., 14:2 (2014), 98–107
Linking options:
https://www.mathnet.ru/eng/vngu340 https://www.mathnet.ru/eng/vngu/v14/i2/p98
|
|