Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Hansen et al. (1982) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: