IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v33y1985i6p1251-1265.html
   My bibliography  Save this article

The Minisum and Minimax Location Problems Revisited

Author

Listed:
  • Pierre Hansen

    (Institut d'Economie Scientifique et de Gestion, Lille, France, and Faculté Universitaire Catholique de Mons, Belgium)

  • Dominique Peeters

    (Université Catholique de Louvain, Belgium)

  • Denis Richard

    (Université Catholique de Louvain, Belgium)

  • Jacques-Francois Thisse

    (Université Catholique de Louvain, Belgium)

Abstract

The minisum (minimax) problem consists of locating a single facility in the plane with the aim of minimizing the sum of the weighted distances (the maximum weighted distance) to m given points. We present two solution methods for generalized versions of these problems in which (i) location is restricted to the union of a finite number of convex polygons; (ii) distances are approximated by norms that may differ with the given points; and (iii) transportation costs are increasing and continuous functions of distance. Computational experience is described.

Suggested Citation

  • Pierre Hansen & Dominique Peeters & Denis Richard & Jacques-Francois Thisse, 1985. "The Minisum and Minimax Location Problems Revisited," Operations Research, INFORMS, vol. 33(6), pages 1251-1265, December.
    • Handle: RePEc:inm:oropre:v:33:y:1985:i:6:p:1251-1265
    DOI: 10.1287/opre.33.6.1251
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.33.6.1251
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.33.6.1251?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
    ---><---

    Other versions of this item:

    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:oropre:v:33:y:1985:i:6:p:1251-1265. 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.