IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v40y1992i1-supplement-1ps56-s66.html
   My bibliography  Save this article

m-Median and m-Center Problems with Mutual Communication: Solvable Special Cases

Author

Listed:
  • Dilip Chhajed

    (University of Illinois, Champaign, Illinois)

  • Timothy J. Lowe

    (University of Iowa, Iowa City, Iowa)

Abstract

In this paper, we consider the network version of the m -median problem with mutual communication (MMMC). We reformulate this problem as a graph theoretic node selection problem defined on a special graph. We give a polynomial time algorithm to solve the node selection problem when the flow graph (graph that denotes the interaction between pairs of new facilities in MMMC) has a special structure. We also show that with some modification in the algorithm for MMMC, the m -center problem with mutual communication can also be solved when the flow graph has a special structure.

Suggested Citation

  • Dilip Chhajed & Timothy J. Lowe, 1992. "m-Median and m-Center Problems with Mutual Communication: Solvable Special Cases," Operations Research, INFORMS, vol. 40(1-supplem), pages 56-66, February.
    • Handle: RePEc:inm:oropre:v:40:y:1992:i:1-supplement-1:p:s56-s66
    DOI: 10.1287/opre.40.1.S56
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.40.1.S56
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.40.1.S56?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. Aykin, Turgut, 1995. "The hub location and routing problem," European Journal of Operational Research, Elsevier, vol. 83(1), pages 200-219, May.
    2. Onur Şeref & Ya-Ju Fan & Elan Borenstein & Wanpracha A. Chaovalitwongse, 2018. "Information-theoretic feature selection with discrete $$k$$ k -median clustering," Annals of Operations Research, Springer, vol. 263(1), pages 93-118, April.

    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:oropre:v:40:y:1992:i:1-supplement-1:p:s56-s66. 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.