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.
Volume (Year): 28 (1982)
Issue (Month): 11 (November)
|Contact details of provider:|| Postal: |
Web page: http://www.informs.org/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:28:y:1982:i:11:p:1285-1295. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc)
If references are entirely missing, you can add them using this form.