An Algorithm for a Constrained Weber Problem
P. Hansen, D. Peeters, J.-F. Thisse
Management Science · 1982 · Volume 28 · Issue 11
Abstract
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.
Keywords
facilities: location algorithm
Enable JavaScript for citation tools and additional paper interactions.