An Algorithm for a Constrained Weber Problem
- 1 November 1982
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Management Science
- Vol. 28 (11) , 1285-1295
- https://doi.org/10.1287/mnsc.28.11.1285
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.facilities: location algorithmKeywords
This publication has 0 references indexed in Scilit: