[go: up one dir, main page]
IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v24y1990i1p77-78.html
   My bibliography  Save this article

Technical Note—Conditional Location Problems on Networks

Author

Listed:
  • Oded Berman

    (College of Management, University of Massachusetts, Harbor Campus, Boston, Massachusetts 02125)

  • David Simchi-Levi

    (Department of Industrial Engineering and Operations Research, Columbia University, New York, New York 10027)

Abstract
In this paper, we describe an algorithm to solve conditional location problems (such as the conditional p -median problem or the conditional p -center problem) on networks, where demand points are served by the closest facility whether existing or new. This algorithm requires the one-time solution of a ( p + 1)-unconditional corresponding location problem using an appropriate shortest distance matrix.

Suggested Citation

  • Oded Berman & David Simchi-Levi, 1990. "Technical Note—Conditional Location Problems on Networks," Transportation Science, INFORMS, vol. 24(1), pages 77-78, February.
    • Handle: RePEc:inm:ortrsc:v:24:y:1990:i:1:p:77-78
    DOI: 10.1287/trsc.24.1.77
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.24.1.77
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.24.1.77?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. Chandra Ade Irawan & Said Salhi & Zvi Drezner, 2016. "Hybrid meta-heuristics with VNS and exact methods: application to large unconditional and conditional vertex $$p$$ p -centre problems," Journal of Heuristics, Springer, vol. 22(4), pages 507-537, August.
    2. Mohammad Yavari & Mohammad Mousavi-Saleh, 2021. "Restructuring hierarchical capacitated facility location problem with extended coverage radius under uncertainty," Operational Research, Springer, vol. 21(1), pages 91-138, March.
    3. Marilène Cherkesly & Claudio Contardo, 2021. "The conditional p-dispersion problem," Journal of Global Optimization, Springer, vol. 81(1), pages 23-83, September.
    4. Tammy Drezner & Zvi Drezner & Pawel Kalczynski, 2021. "Directional approach to gradual cover: the continuous case," Computational Management Science, Springer, vol. 18(1), pages 25-47, January.
    5. R. L. Francis & T. J. Lowe & Arie Tamir, 2000. "Aggregation Error Bounds for a Class of Location Models," Operations Research, INFORMS, vol. 48(2), pages 294-307, April.
    6. Tammy Drezner & Zvi Drezner & Pawel Kalczynski, 2019. "A directional approach to gradual cover," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 27(1), pages 70-93, April.
    7. O Berman & Z Drezner & G O Wesolowsky, 2008. "The multiple location of transfer points," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(6), pages 805-811, June.
    8. Pawel Kalczynski & Zvi Drezner, 2021. "The obnoxious facilities planar p-median problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 43(2), pages 577-593, June.
    9. 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.

    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:24:y:1990:i:1:p:77-78. 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.