IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v22y1988i2p157-160.html
   My bibliography  Save this article

Conditional Minisum and Minimax Location-Allocation Problems in Euclidean Space

Author

Listed:
  • Reuven Chen

    (Tel Aviv University, Tel Aviv, Israel)

Abstract

The problems of minimax and minisum location-allocation in two-dimensional Euclidean space, where some fixed service centers already exist in the area in question, are treated. The method utilized is an extension to a previously reported algorithm for the solution of the unconditional problem and yields good local minima. In the minisum problem this is at the moment the only feasible way to obtain any solutions. In the minimax case, a method for finding optimal solutions has been developed in parallel. However, the latter can yield results only to problems of limited size. A possible combination of the two methods is suggested.

Suggested Citation

  • Reuven Chen, 1988. "Conditional Minisum and Minimax Location-Allocation Problems in Euclidean Space," Transportation Science, INFORMS, vol. 22(2), pages 157-160, May.
    • Handle: RePEc:inm:ortrsc:v:22:y:1988:i:2:p:157-160
    DOI: 10.1287/trsc.22.2.157
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.22.2.157
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.22.2.157?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. R. Chen & Y. Handler, 1993. "The conditional p‐center problem in the plane," Naval Research Logistics (NRL), John Wiley & Sons, vol. 40(1), pages 117-127, February.
    2. Tammy Drezner & Zvi Drezner, 2016. "Sequential location of two facilities: comparing random to optimal location of the first facility," Annals of Operations Research, Springer, vol. 246(1), pages 5-18, November.
    3. Pey-Chun Chen & Pierre Hansen & Brigitte Jaumard & Hoang Tuy, 1998. "Solution of the Multisource Weber and Conditional Weber Problems by D.-C. Programming," Operations Research, INFORMS, vol. 46(4), pages 548-562, August.

    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:inm:ortrsc:v:22:y:1988:i:2:p:157-160. 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.