Exact and Heuristic Algorithms for Solving Discrete Weber Problem for a Simple Cycle

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.