| Abstract: | The paper is an extension of the authors previous work [5] in which an approximate discrete technique is proposed to solve the Weber problem with the Euclidean distance. Now, it is assumed that the cost of connection (the cost associated with two points in the plane) depends upon the distance stronger than linearly. A model is formulated and an approximate discrete technique analogous to that in [5] is proposed. Its validity is proved. Both the numerical complexity and the practical efficiency of the algorithm are considered. An example is given |
