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

Technical Note—A Polynomial Algorithm for the Equal Capacity p-Center Problem on Trees

Author

Listed:
  • Mordechai Jaeger

    (Department of Systems and Industrial Engineering, University of Arizona, Tucson, Arizona 85721)

  • Jeff Goldberg

    (Department of Systems and Industrial Engineering, University of Arizona, Tucson, Arizona 85721)

Abstract

The uncapacitated p -center problem has been shown to be NP-Hard for the case of a general network, yet polynomial algorithms exist for the case of a tree network. We extend the results for trees to include the case where each center can serve a limited number of customers and show that the capacitated p -center problem on trees can be solved in polynomial time when the capacities are identical. The algorithm consists of solving a capacitated covering problem and then using search routines to find the optimal domination radius. We show that the addition of center capacities to either the vertex center problem or the absolute center problem requires a multiplicative factor of O ( n ) more work, relative to that required for the uncapacitated problems, to solve the related covering problems ( n is the number of vertices in the tree).

Suggested Citation

  • Mordechai Jaeger & Jeff Goldberg, 1994. "Technical Note—A Polynomial Algorithm for the Equal Capacity p-Center Problem on Trees," Transportation Science, INFORMS, vol. 28(2), pages 167-175, May.
    • Handle: RePEc:inm:ortrsc:v:28:y:1994:i:2:p:167-175
    DOI: 10.1287/trsc.28.2.167
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.28.2.167
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.28.2.167?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. Bo Zhang & Jin Peng & Shengguo Li, 2021. "Minimax models for capacitated p-center problem in uncertain environment," Fuzzy Optimization and Decision Making, Springer, vol. 20(3), pages 273-292, September.
    2. Raphael Kramer & Manuel Iori & Thibaut Vidal, 2020. "Mathematical Models and Search Algorithms for the Capacitated p -Center Problem," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 444-460, April.

    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:28:y:1994:i:2:p:167-175. 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.