IDEAS home Printed from
   My bibliography  Save this article

The robustness of two common heuristics for the p-median problem


  • K E Rosing
  • Hester Rosing-Vogelaar
  • E L Hillsman


Optimal p- median solutions were computedfor six test problems on a network of forty-nine demand nodes and compared with solutions from two heuristic algorithms. Comparison of the optimal solutions with those from the Teitz and Bart heuristic indicates that this heuristic is very robust. Tests of the Maranzana heuristic, however, indicate that it is efficient only for small values of p (numbers of facilities) and that its robustness decreases rapidly as problem size increases.

Suggested Citation

  • K E Rosing & Hester Rosing-Vogelaar & E L Hillsman, 1979. "The robustness of two common heuristics for the p-median problem," Environment and Planning A, Pion Ltd, London, vol. 11(4), pages 373-380, April.
  • Handle: RePEc:pio:envira:v:11:y:1979:i:4:p:373-380

    Download full text from publisher

    File URL:
    File Function: abstract
    Download Restriction: Fulltext access restricted to subscribers, see for details

    File URL:
    File Function: main text
    Download Restriction: Fulltext access restricted to subscribers, see for details

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


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

    Cited by:

    1. Rosing, K. E. & ReVelle, C. S., 1997. "Heuristic concentration: Two stage solution construction," European Journal of Operational Research, Elsevier, vol. 97(1), pages 75-86, February.

    More about this item


    Access and download statistics


    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:pio:envira:v:11:y:1979:i:4:p:373-380. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Neil Hammond). General contact details of provider: .

    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 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.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.