Exact algorithm for solving discrete Weber problem for a cycle

A polynomial algorithm solving discrete Weber problem for cycle and for finite set of location positions is presented. The algorithm is based on the dynamic programming idea. The comparison of action times of the given algorithm and of an integer linear programming model, which was realized in IBM ILOG CPLEX, is carried out.