Exact algorithm for solving special case of discrete weber problem
An algorithm reasonably solving Weber problem for n-sequentially connected chain and finite set of points of location is described. The algorithm is compared with an integer linear programming algorithm realized in IBM ILOG CPLEX.