COMPUTERS & OPERATIONS RESEARCH, vol.62, pp.237-256, 2015 (Peer-Reviewed Journal)
Article / Article
COMPUTERS & OPERATIONS RESEARCH
Science Citation Index Expanded, Scopus
Facility location problems, Second order cone programming, Minimum sum of squares clustering, Hyperbolic smoothing, MINISUM LOCATION, WEBER PROBLEM, RESPECT
We consider a continuous multi-facility location allocation problem where the demanding entities are regions in the plane instead of points. The problem can be stated as follows: given m (closed, convex) polygonal demand regions in the plane, find the locations of q facilities and allocate each region to exactly one facility so as to minimize a weighted sum of squares of the maximum Euclidean distances between the demand regions and the facilities they are assigned to.