Showing 1 - 1 of 1
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.
Persistent link: https://www.econbiz.de/10009218139