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

Conditional p -Center Problems

Author

Listed:
  • Zvi Drezner

    (California State University, Fullerton, California 92634)

Abstract

It is shown that conditional p -center problems can be solved by solving O (log n ) p -center problems where n is the number of demand points. Therefore, once an efficient algorithm exists for the p -center problem (by any metric or on a network), then an efficient one can be built for the conditional version of the problem.

Suggested Citation

  • Zvi Drezner, 1989. "Conditional p -Center Problems," Transportation Science, INFORMS, vol. 23(1), pages 51-53, February.
    • Handle: RePEc:inm:ortrsc:v:23:y:1989:i:1:p:51-53
    DOI: 10.1287/trsc.23.1.51
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.23.1.51
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.23.1.51?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. Marilène Cherkesly & Claudio Contardo, 2021. "The conditional p-dispersion problem," Journal of Global Optimization, Springer, vol. 81(1), pages 23-83, September.

    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:23:y:1989:i:1:p:51-53. 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.