IDEAS home Printed from
   My bibliography  Save this article

An Algorithm for a Constrained Weber Problem


  • 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.

Suggested Citation

  • P. Hansen & D. Peeters & J.-F. Thisse, 1982. "An Algorithm for a Constrained Weber Problem," Management Science, INFORMS, vol. 28(11), pages 1285-1295, November.
  • Handle: RePEc:inm:ormnsc:v:28:y:1982:i:11:p:1285-1295

    Download full text from publisher

    File URL:
    Download Restriction: no


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

    Cited by:

    1. Jian-lin Jiang & Ya Xu, 2006. "Minisum location problem with farthest Euclidean distances," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 64(2), pages 285-308, October.
    2. Nickel, Stefan, 1998. "Restricted center problems under polyhedral gauges," European Journal of Operational Research, Elsevier, vol. 104(2), pages 343-357, January.
    3. Francisco André & Francisco Velasco & Luis Gonzalez-Abril, 2009. "Intertemporal and spatial location of disposal facilities," Spanish Economic Review, Springer;Spanish Economic Association, vol. 11(1), pages 23-49, March.
    4. repec:spr:compst:v:64:y:2006:i:2:p:285-308 is not listed on IDEAS
    5. 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.
    6. Phipps Arabie, 1991. "Was euclid an unnecessarily sophisticated psychologist?," Psychometrika, Springer;The Psychometric Society, vol. 56(4), pages 567-587, December.

    More about this item


    facilities: location algorithm;


    Access and download statistics


    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. 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). General contact details of provider: .

    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.

    We have no references for this item. You can help adding them by using 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 RePEc Author Service 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.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.