An algorithm for approximate solution to the Weber problem on a line with forbidden gaps
The location problem of interconnected facilities on a line with forbidden gaps is considered. The properties of the problem which allow the initial continuous problem to be reduced to the discrete problem are found. The approximate algorithm for solving the problem is developed and the results of computational experiments are presented. Tab. 1, bibliogr. 15.