An Algorithm for a Constrained Weber Problem

Published Online:https://doi.org/10.1287/mnsc.28.11.1285

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.

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.