IDEAS home Printed from https://ideas.repec.org/p/cor/louvrp/683.html
   My bibliography  Save this paper

The minisum and minimax location problems revisited

Author

Listed:
  • HANSEN, Pierre
  • PEETERS, Dominique
  • RICHARD, Denis
  • THISSE, Jacques-François

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.
(This abstract was borrowed from another version of this item.)

Suggested Citation

  • HANSEN, Pierre & PEETERS, Dominique & RICHARD, Denis & THISSE, Jacques-François, 1985. "The minisum and minimax location problems revisited," LIDAM Reprints CORE 683, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    • Handle: RePEc:cor:louvrp:683
    DOI: 10.1287/opre.33.6.1251
    Note: In : Operations Research, 33(6), 1251-1265, 1985
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Other versions of this item:

    More about this item

    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:cor:louvrp:683. 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: Alain GILLIS (email available below). General contact details of provider: https://edirc.repec.org/data/coreebe.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.