IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v28y1982i11p1285-1295.html
   My bibliography  Save this article

An Algorithm for a Constrained Weber Problem

Author

Listed:
  • 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)

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.

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
    DOI: 10.1287/mnsc.28.11.1285
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.28.11.1285
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.28.11.1285?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

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


    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. 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.
    5. Phipps Arabie, 1991. "Was euclid an unnecessarily sophisticated psychologist?," Psychometrika, Springer;The Psychometric Society, vol. 56(4), pages 567-587, December.
    6. Jiwon Baik & Alan T. Murray, 2022. "Locating a facility to simultaneously address access and coverage goals," Papers in Regional Science, Wiley Blackwell, vol. 101(5), pages 1199-1217, October.
    7. H. W. Hamacher & S. Nickel, 1995. "Restricted planar location problems and applications," Naval Research Logistics (NRL), John Wiley & Sons, vol. 42(6), pages 967-992, September.
    8. J. Brimberg & S. Salhi, 2005. "A Continuous Location-Allocation Problem with Zone-Dependent Fixed Cost," Annals of Operations Research, Springer, vol. 136(1), pages 99-115, April.

    More about this item

    Keywords

    facilities: location algorithm;

    Statistics

    Access and download statistics

    Corrections

    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.

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

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.