An exact algorithm for solving the discrete Weber problem for a $k$-tree

We consider the discrete Weber problem. A consistent deterministic algorithm for finding an exact solution to the problem for a $k$-tree and a finite set of placement positions is suggested. The algorithm is based on the idea of dynamic programming with a decomposition tree. A numerical experiment was performed to examine the effectiveness of the proposed algorithm in comparison with IBM ILOG CPLEX. Ill. 2, bibliogr. 23.