An Algorithm for a Constrained Weber Problem
提出一种算法，用于解决可行位置为有限个凸多边形并集时的韦伯问题，对选址优化研究有参考价值。
We present an algorithm for solving the Weber problem when the set of feasible locations is the union of a finite number of convex polygons.