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.

• 저널Management Science · 28(11) · 1285–1295
• 토픽Facility Location and Emergency Management · Organizational Behavior and Human Resource Management
• DOI10.1287/mnsc.28.11.1285
• 저자Pierre Hansen, Dominique Peeters, Jacques‐François Thisse