IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v14y1986i5p383-389.html
   My bibliography  Save this article

Locating independent facilities with maximum weight: Greedy heuristics

Author

Listed:
  • Chaudhry, Sohail S
  • McCormick, S Thomas
  • Moon, I Douglas

Abstract

The problem is to locate a maximum-weight set of facilities such that no two are closer than a given distance from each other. The unweighted version is equivalent to the maximum independent set problem in graph theory. This paper presents four greedy heuristics and shows that they all have bad worst-case behavior. Empirically, however, these heuristics perform quite well in the relatively large test problems generated randomly.

Suggested Citation

  • Chaudhry, Sohail S & McCormick, S Thomas & Moon, I Douglas, 1986. "Locating independent facilities with maximum weight: Greedy heuristics," Omega, Elsevier, vol. 14(5), pages 383-389.
    • Handle: RePEc:eee:jomega:v:14:y:1986:i:5:p:383-389
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0305-0483(86)90079-4
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Murray, Alan T. & Church, Richard L., 1997. "Facets for node packing," European Journal of Operational Research, Elsevier, vol. 101(3), pages 598-608, September.
    2. Niblett, Matthew R. & Church, Richard L., 2015. "The disruptive anti-covering location problem," European Journal of Operational Research, Elsevier, vol. 247(3), pages 764-773.
    3. Sayyady, Fatemeh & Fathi, Yahya, 2016. "An integer programming approach for solving the p-dispersion problem," European Journal of Operational Research, Elsevier, vol. 253(1), pages 216-225.
    4. David Sayah & Stefan Irnich, 2015. "A New Compact Formulation for Discrete p-Dispersion," Working Papers 1517, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    5. Heewon Chea & Hyun Kim & Shih-Lung Shaw & Yongwan Chun, 2022. "Assessing Trauma Center Accessibility for Healthcare Equity Using an Anti-Covering Approach," IJERPH, MDPI, vol. 19(3), pages 1-21, January.
    6. Sayah, David & Irnich, Stefan, 2017. "A new compact formulation for the discrete p-dispersion problem," European Journal of Operational Research, Elsevier, vol. 256(1), pages 62-67.

    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:eee:jomega:v:14:y:1986:i:5:p:383-389. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description .

    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.