Advanced Search
MyIDEAS: Login to save this article or follow this journal

An Algorithm for a Constrained Weber Problem


Author Info

  • P. Hansen

    (Institut d'Economie Scientifique et de Gestion, Lille and FUCAM, Mons)

  • D. Peeters

    (Unité de Geographie Economique, Louvain-la-Neuve)

  • J.-F. Thisse

    (S.P.U.R., Louvaine-la-Neuve)


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.

Download Info

If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
File URL:
Download Restriction: no

Bibliographic Info

Article provided by INFORMS in its journal Management Science.

Volume (Year): 28 (1982)
Issue (Month): 11 (November)
Pages: 1285-1295

as in new window
Handle: RePEc:inm:ormnsc:v:28:y:1982:i:11:p:1285-1295

Contact details of provider:
Postal: 7240 Parkway Drive, Suite 300, Hanover, MD 21076 USA
Phone: +1-443-757-3500
Fax: 443-757-3515
Web page:
More information through EDIRC

Related research

Keywords: facilities: location algorithm;


No references listed on IDEAS
You can help add them by filling out this form.


Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as in new window

Cited by:
  1. Francisco J. André & Francisco Velasco & Luis González, 2004. "Intertemporal and Spatial Location of Disposal Facilities," Economic Working Papers at Centro de Estudios Andaluces E2004/74, Centro de Estudios Andaluces.
  2. Jianlin Jiang & Xiaoming Yuan, 2012. "A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand," Computational Optimization and Applications, Springer, vol. 51(3), pages 1275-1295, April.
  3. Nickel, Stefan, 1998. "Restricted center problems under polyhedral gauges," European Journal of Operational Research, Elsevier, vol. 104(2), pages 343-357, January.
  4. Jian-lin Jiang & Ya Xu, 2006. "Minisum location problem with farthest Euclidean distances," Computational Statistics, Springer, vol. 64(2), pages 285-308, October.
  5. Phipps Arabie, 1991. "Was euclid an unnecessarily sophisticated psychologist?," Psychometrika, Springer, vol. 56(4), pages 567-587, December.


This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.


Access and download statistics


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 you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

If references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

Please note that corrections may take a couple of weeks to filter through the various RePEc services.