The location problem is to find a point M whose sum of weighted distances from m vertices in p-dimensional Euclidean space is a minimum. The bestknown algorithm for solving the location problem is an ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback